./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi000_pso.oepc_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/rfi000_pso.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec62b1fa1dfab5118959156fde533654a621048a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:45:19,161 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 22:45:19,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 22:45:19,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 22:45:19,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 22:45:19,178 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 22:45:19,180 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 22:45:19,182 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 22:45:19,184 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 22:45:19,185 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 22:45:19,186 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 22:45:19,186 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 22:45:19,187 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 22:45:19,188 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 22:45:19,190 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 22:45:19,191 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 22:45:19,192 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 22:45:19,194 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 22:45:19,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 22:45:19,198 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 22:45:19,200 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 22:45:19,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 22:45:19,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 22:45:19,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 22:45:19,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 22:45:19,207 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 22:45:19,208 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 22:45:19,209 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 22:45:19,210 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 22:45:19,212 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 22:45:19,212 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 22:45:19,213 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 22:45:19,213 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 22:45:19,213 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 22:45:19,215 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 22:45:19,216 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 22:45:19,216 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:45:19,248 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 22:45:19,248 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 22:45:19,250 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 22:45:19,250 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 22:45:19,251 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 22:45:19,251 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 22:45:19,252 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 22:45:19,252 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 22:45:19,252 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 22:45:19,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 22:45:19,252 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 22:45:19,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 22:45:19,253 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 22:45:19,253 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 22:45:19,253 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 22:45:19,253 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 22:45:19,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 22:45:19,254 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 22:45:19,255 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 22:45:19,255 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 22:45:19,255 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 22:45:19,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:45:19,255 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 22:45:19,255 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 22:45:19,256 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 22:45:19,256 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 22:45:19,256 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 22:45:19,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 22:45:19,256 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 -> ec62b1fa1dfab5118959156fde533654a621048a [2018-12-31 22:45:19,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 22:45:19,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 22:45:19,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 22:45:19,326 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 22:45:19,326 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 22:45:19,328 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi000_pso.oepc_false-unreach-call.i [2018-12-31 22:45:19,393 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9ff4fb7/24fac6ab7ee140758b317e429ca5a46c/FLAG34976e8a6 [2018-12-31 22:45:19,987 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 22:45:19,992 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi000_pso.oepc_false-unreach-call.i [2018-12-31 22:45:20,014 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9ff4fb7/24fac6ab7ee140758b317e429ca5a46c/FLAG34976e8a6 [2018-12-31 22:45:20,255 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9ff4fb7/24fac6ab7ee140758b317e429ca5a46c [2018-12-31 22:45:20,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 22:45:20,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 22:45:20,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 22:45:20,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 22:45:20,270 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 22:45:20,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:45:20" (1/1) ... [2018-12-31 22:45:20,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b20f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:20, skipping insertion in model container [2018-12-31 22:45:20,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:45:20" (1/1) ... [2018-12-31 22:45:20,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 22:45:20,373 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 22:45:20,932 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:45:20,946 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 22:45:21,114 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:45:21,208 INFO L195 MainTranslator]: Completed translation [2018-12-31 22:45:21,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:21 WrapperNode [2018-12-31 22:45:21,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 22:45:21,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 22:45:21,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 22:45:21,212 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 22:45:21,223 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:45:21" (1/1) ... [2018-12-31 22:45:21,269 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:45:21" (1/1) ... [2018-12-31 22:45:21,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 22:45:21,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 22:45:21,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 22:45:21,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 22:45:21,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:21" (1/1) ... [2018-12-31 22:45:21,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:21" (1/1) ... [2018-12-31 22:45:21,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:21" (1/1) ... [2018-12-31 22:45:21,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:21" (1/1) ... [2018-12-31 22:45:21,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:21" (1/1) ... [2018-12-31 22:45:21,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:21" (1/1) ... [2018-12-31 22:45:21,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:21" (1/1) ... [2018-12-31 22:45:21,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 22:45:21,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 22:45:21,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 22:45:21,381 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 22:45:21,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:21" (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:45:21,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 22:45:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 22:45:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 22:45:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 22:45:21,463 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 22:45:21,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 22:45:21,463 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 22:45:21,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 22:45:21,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 22:45:21,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 22:45:21,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 22:45:21,468 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:45:23,459 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 22:45:23,460 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 22:45:23,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:45:23 BoogieIcfgContainer [2018-12-31 22:45:23,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 22:45:23,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 22:45:23,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 22:45:23,466 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 22:45:23,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:45:20" (1/3) ... [2018-12-31 22:45:23,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330a86bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:45:23, skipping insertion in model container [2018-12-31 22:45:23,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:45:21" (2/3) ... [2018-12-31 22:45:23,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330a86bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:45:23, skipping insertion in model container [2018-12-31 22:45:23,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:45:23" (3/3) ... [2018-12-31 22:45:23,470 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_pso.oepc_false-unreach-call.i [2018-12-31 22:45:23,535 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,536 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,536 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,536 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,536 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,536 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,537 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,537 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,538 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,538 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,538 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,538 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,538 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,539 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,539 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,539 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,539 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,540 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,540 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,540 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,540 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,541 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,541 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,541 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,541 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,541 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,545 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,547 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,547 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,547 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,547 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,547 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,547 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,548 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,548 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,548 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,549 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,549 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,549 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,549 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,549 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:45:23,637 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 22:45:23,637 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 22:45:23,651 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 22:45:23,672 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 22:45:23,705 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 22:45:23,706 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 22:45:23,706 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 22:45:23,706 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 22:45:23,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 22:45:23,706 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 22:45:23,706 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 22:45:23,708 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 22:45:23,708 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 22:45:23,746 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 226places, 306 transitions [2018-12-31 22:45:44,671 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 148584 states. [2018-12-31 22:45:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 148584 states. [2018-12-31 22:45:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 22:45:44,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:45:44,682 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] [2018-12-31 22:45:44,684 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:45:44,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:45:44,690 INFO L82 PathProgramCache]: Analyzing trace with hash -614504401, now seen corresponding path program 1 times [2018-12-31 22:45:44,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:45:44,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:45:44,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:45:44,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:45:44,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:45:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:45:44,981 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:45:44,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:45:44,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:45:44,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:45:45,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:45:45,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:45:45,006 INFO L87 Difference]: Start difference. First operand 148584 states. Second operand 4 states. [2018-12-31 22:45:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:45:49,340 INFO L93 Difference]: Finished difference Result 272092 states and 1113406 transitions. [2018-12-31 22:45:49,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:45:49,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-31 22:45:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:45:51,050 INFO L225 Difference]: With dead ends: 272092 [2018-12-31 22:45:51,050 INFO L226 Difference]: Without dead ends: 243812 [2018-12-31 22:45:51,052 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:46:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243812 states. [2018-12-31 22:46:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243812 to 140486. [2018-12-31 22:46:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140486 states. [2018-12-31 22:46:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140486 states to 140486 states and 574639 transitions. [2018-12-31 22:46:07,649 INFO L78 Accepts]: Start accepts. Automaton has 140486 states and 574639 transitions. Word has length 33 [2018-12-31 22:46:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:07,650 INFO L480 AbstractCegarLoop]: Abstraction has 140486 states and 574639 transitions. [2018-12-31 22:46:07,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:46:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 140486 states and 574639 transitions. [2018-12-31 22:46:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 22:46:07,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:07,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:46:07,663 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:07,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:07,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1643249749, now seen corresponding path program 1 times [2018-12-31 22:46:07,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:07,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:07,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:07,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:07,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:07,830 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:46:07,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:07,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:46:07,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:46:07,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:46:07,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:46:07,833 INFO L87 Difference]: Start difference. First operand 140486 states and 574639 transitions. Second operand 4 states. [2018-12-31 22:46:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:08,768 INFO L93 Difference]: Finished difference Result 33560 states and 119400 transitions. [2018-12-31 22:46:08,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:46:08,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-31 22:46:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:08,947 INFO L225 Difference]: With dead ends: 33560 [2018-12-31 22:46:08,947 INFO L226 Difference]: Without dead ends: 31742 [2018-12-31 22:46:08,949 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:46:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31742 states. [2018-12-31 22:46:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31742 to 31742. [2018-12-31 22:46:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31742 states. [2018-12-31 22:46:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31742 states to 31742 states and 112962 transitions. [2018-12-31 22:46:09,791 INFO L78 Accepts]: Start accepts. Automaton has 31742 states and 112962 transitions. Word has length 45 [2018-12-31 22:46:09,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:09,794 INFO L480 AbstractCegarLoop]: Abstraction has 31742 states and 112962 transitions. [2018-12-31 22:46:09,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:46:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 31742 states and 112962 transitions. [2018-12-31 22:46:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 22:46:09,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:09,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:46:09,799 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:09,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:09,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1175559771, now seen corresponding path program 1 times [2018-12-31 22:46:09,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:09,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:09,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:09,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:10,136 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:46:10,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:10,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:46:10,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:46:10,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:46:10,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:46:10,137 INFO L87 Difference]: Start difference. First operand 31742 states and 112962 transitions. Second operand 5 states. [2018-12-31 22:46:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:12,129 INFO L93 Difference]: Finished difference Result 63360 states and 222752 transitions. [2018-12-31 22:46:12,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:46:12,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 22:46:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:12,436 INFO L225 Difference]: With dead ends: 63360 [2018-12-31 22:46:12,437 INFO L226 Difference]: Without dead ends: 63250 [2018-12-31 22:46:12,437 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:46:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63250 states. [2018-12-31 22:46:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63250 to 39276. [2018-12-31 22:46:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39276 states. [2018-12-31 22:46:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39276 states to 39276 states and 136384 transitions. [2018-12-31 22:46:13,517 INFO L78 Accepts]: Start accepts. Automaton has 39276 states and 136384 transitions. Word has length 46 [2018-12-31 22:46:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:13,519 INFO L480 AbstractCegarLoop]: Abstraction has 39276 states and 136384 transitions. [2018-12-31 22:46:13,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:46:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 39276 states and 136384 transitions. [2018-12-31 22:46:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 22:46:13,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:13,522 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:46:13,522 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:13,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:13,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1108738337, now seen corresponding path program 1 times [2018-12-31 22:46:13,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:13,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:13,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:13,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:13,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:13,596 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:46:13,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:13,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:46:13,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:46:13,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:46:13,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:46:13,599 INFO L87 Difference]: Start difference. First operand 39276 states and 136384 transitions. Second operand 3 states. [2018-12-31 22:46:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:14,139 INFO L93 Difference]: Finished difference Result 60855 states and 203999 transitions. [2018-12-31 22:46:14,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:46:14,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-31 22:46:14,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:14,322 INFO L225 Difference]: With dead ends: 60855 [2018-12-31 22:46:14,322 INFO L226 Difference]: Without dead ends: 60855 [2018-12-31 22:46:14,323 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:46:14,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60855 states. [2018-12-31 22:46:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60855 to 54767. [2018-12-31 22:46:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54767 states. [2018-12-31 22:46:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54767 states to 54767 states and 184631 transitions. [2018-12-31 22:46:17,263 INFO L78 Accepts]: Start accepts. Automaton has 54767 states and 184631 transitions. Word has length 48 [2018-12-31 22:46:17,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:17,263 INFO L480 AbstractCegarLoop]: Abstraction has 54767 states and 184631 transitions. [2018-12-31 22:46:17,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:46:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 54767 states and 184631 transitions. [2018-12-31 22:46:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 22:46:17,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:17,267 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] [2018-12-31 22:46:17,267 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:17,267 INFO L82 PathProgramCache]: Analyzing trace with hash 28084908, now seen corresponding path program 1 times [2018-12-31 22:46:17,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:17,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:17,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:17,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:17,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:17,565 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:46:17,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:17,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:46:17,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:46:17,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:46:17,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:46:17,568 INFO L87 Difference]: Start difference. First operand 54767 states and 184631 transitions. Second operand 8 states. [2018-12-31 22:46:19,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:19,782 INFO L93 Difference]: Finished difference Result 69731 states and 227684 transitions. [2018-12-31 22:46:19,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 22:46:19,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-12-31 22:46:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:19,971 INFO L225 Difference]: With dead ends: 69731 [2018-12-31 22:46:19,971 INFO L226 Difference]: Without dead ends: 69607 [2018-12-31 22:46:19,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-12-31 22:46:20,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69607 states. [2018-12-31 22:46:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69607 to 56775. [2018-12-31 22:46:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56775 states. [2018-12-31 22:46:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56775 states to 56775 states and 189920 transitions. [2018-12-31 22:46:21,216 INFO L78 Accepts]: Start accepts. Automaton has 56775 states and 189920 transitions. Word has length 52 [2018-12-31 22:46:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:21,216 INFO L480 AbstractCegarLoop]: Abstraction has 56775 states and 189920 transitions. [2018-12-31 22:46:21,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:46:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 56775 states and 189920 transitions. [2018-12-31 22:46:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-31 22:46:21,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:21,226 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] [2018-12-31 22:46:21,226 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:21,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:21,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1485356584, now seen corresponding path program 1 times [2018-12-31 22:46:21,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:21,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:21,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:21,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:21,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:21,397 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:46:21,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:21,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:46:21,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:46:21,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:46:21,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:46:21,398 INFO L87 Difference]: Start difference. First operand 56775 states and 189920 transitions. Second operand 6 states. [2018-12-31 22:46:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:22,981 INFO L93 Difference]: Finished difference Result 110773 states and 367372 transitions. [2018-12-31 22:46:22,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 22:46:22,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-31 22:46:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:23,264 INFO L225 Difference]: With dead ends: 110773 [2018-12-31 22:46:23,264 INFO L226 Difference]: Without dead ends: 110717 [2018-12-31 22:46:23,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:46:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110717 states. [2018-12-31 22:46:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110717 to 72935. [2018-12-31 22:46:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72935 states. [2018-12-31 22:46:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72935 states to 72935 states and 238398 transitions. [2018-12-31 22:46:28,918 INFO L78 Accepts]: Start accepts. Automaton has 72935 states and 238398 transitions. Word has length 62 [2018-12-31 22:46:28,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:28,918 INFO L480 AbstractCegarLoop]: Abstraction has 72935 states and 238398 transitions. [2018-12-31 22:46:28,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:46:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 72935 states and 238398 transitions. [2018-12-31 22:46:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 22:46:28,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:28,932 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:46:28,933 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:28,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:28,933 INFO L82 PathProgramCache]: Analyzing trace with hash -260667191, now seen corresponding path program 1 times [2018-12-31 22:46:28,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:28,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:28,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:28,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:28,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:29,348 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:46:29,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:29,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:46:29,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:46:29,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:46:29,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:46:29,350 INFO L87 Difference]: Start difference. First operand 72935 states and 238398 transitions. Second operand 7 states. [2018-12-31 22:46:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:31,326 INFO L93 Difference]: Finished difference Result 119360 states and 393342 transitions. [2018-12-31 22:46:31,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 22:46:31,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-12-31 22:46:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:31,650 INFO L225 Difference]: With dead ends: 119360 [2018-12-31 22:46:31,650 INFO L226 Difference]: Without dead ends: 119288 [2018-12-31 22:46:31,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-12-31 22:46:32,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119288 states. [2018-12-31 22:46:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119288 to 77093. [2018-12-31 22:46:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77093 states. [2018-12-31 22:46:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77093 states to 77093 states and 250179 transitions. [2018-12-31 22:46:33,479 INFO L78 Accepts]: Start accepts. Automaton has 77093 states and 250179 transitions. Word has length 68 [2018-12-31 22:46:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:33,479 INFO L480 AbstractCegarLoop]: Abstraction has 77093 states and 250179 transitions. [2018-12-31 22:46:33,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:46:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 77093 states and 250179 transitions. [2018-12-31 22:46:33,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-31 22:46:33,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:33,502 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] [2018-12-31 22:46:33,503 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:33,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:33,503 INFO L82 PathProgramCache]: Analyzing trace with hash -760398597, now seen corresponding path program 1 times [2018-12-31 22:46:33,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:33,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:33,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:33,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:33,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:33,825 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 22:46:34,010 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:46:34,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:34,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 22:46:34,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 22:46:34,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 22:46:34,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:46:34,011 INFO L87 Difference]: Start difference. First operand 77093 states and 250179 transitions. Second operand 9 states. [2018-12-31 22:46:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:38,501 INFO L93 Difference]: Finished difference Result 104535 states and 331511 transitions. [2018-12-31 22:46:38,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-31 22:46:38,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-12-31 22:46:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:38,756 INFO L225 Difference]: With dead ends: 104535 [2018-12-31 22:46:38,757 INFO L226 Difference]: Without dead ends: 104479 [2018-12-31 22:46:38,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-12-31 22:46:39,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104479 states. [2018-12-31 22:46:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104479 to 77966. [2018-12-31 22:46:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77966 states. [2018-12-31 22:46:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77966 states to 77966 states and 252956 transitions. [2018-12-31 22:46:41,330 INFO L78 Accepts]: Start accepts. Automaton has 77966 states and 252956 transitions. Word has length 74 [2018-12-31 22:46:41,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:41,330 INFO L480 AbstractCegarLoop]: Abstraction has 77966 states and 252956 transitions. [2018-12-31 22:46:41,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 22:46:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 77966 states and 252956 transitions. [2018-12-31 22:46:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-31 22:46:41,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:41,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:46:41,355 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:41,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2014750299, now seen corresponding path program 1 times [2018-12-31 22:46:41,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:41,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:41,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:41,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:41,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:41,496 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:46:41,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:41,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:46:41,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:46:41,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:46:41,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:46:41,498 INFO L87 Difference]: Start difference. First operand 77966 states and 252956 transitions. Second operand 5 states. [2018-12-31 22:46:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:42,125 INFO L93 Difference]: Finished difference Result 110313 states and 360156 transitions. [2018-12-31 22:46:42,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:46:42,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-31 22:46:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:42,370 INFO L225 Difference]: With dead ends: 110313 [2018-12-31 22:46:42,370 INFO L226 Difference]: Without dead ends: 110313 [2018-12-31 22:46:42,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:46:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110313 states. [2018-12-31 22:46:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110313 to 102002. [2018-12-31 22:46:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102002 states. [2018-12-31 22:46:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102002 states to 102002 states and 332817 transitions. [2018-12-31 22:46:44,275 INFO L78 Accepts]: Start accepts. Automaton has 102002 states and 332817 transitions. Word has length 76 [2018-12-31 22:46:44,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:44,276 INFO L480 AbstractCegarLoop]: Abstraction has 102002 states and 332817 transitions. [2018-12-31 22:46:44,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:46:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 102002 states and 332817 transitions. [2018-12-31 22:46:44,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-31 22:46:44,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:44,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:46:44,306 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:44,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:44,306 INFO L82 PathProgramCache]: Analyzing trace with hash -271939964, now seen corresponding path program 1 times [2018-12-31 22:46:44,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:44,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:44,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:44,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:44,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:44,748 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:46:44,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:44,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:46:44,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:46:44,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:46:44,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:46:44,749 INFO L87 Difference]: Start difference. First operand 102002 states and 332817 transitions. Second operand 7 states. [2018-12-31 22:46:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:48,223 INFO L93 Difference]: Finished difference Result 187768 states and 613432 transitions. [2018-12-31 22:46:48,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:46:48,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-31 22:46:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:48,704 INFO L225 Difference]: With dead ends: 187768 [2018-12-31 22:46:48,705 INFO L226 Difference]: Without dead ends: 187697 [2018-12-31 22:46:48,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-31 22:46:49,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187697 states. [2018-12-31 22:46:51,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187697 to 121808. [2018-12-31 22:46:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121808 states. [2018-12-31 22:46:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121808 states to 121808 states and 391873 transitions. [2018-12-31 22:46:51,375 INFO L78 Accepts]: Start accepts. Automaton has 121808 states and 391873 transitions. Word has length 76 [2018-12-31 22:46:51,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:51,375 INFO L480 AbstractCegarLoop]: Abstraction has 121808 states and 391873 transitions. [2018-12-31 22:46:51,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:46:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 121808 states and 391873 transitions. [2018-12-31 22:46:51,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-31 22:46:51,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:51,415 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] [2018-12-31 22:46:51,415 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:51,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:51,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2068033077, now seen corresponding path program 1 times [2018-12-31 22:46:51,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:51,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:51,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:51,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:51,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:51,670 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:46:51,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:51,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:46:51,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:46:51,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:46:51,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:46:51,673 INFO L87 Difference]: Start difference. First operand 121808 states and 391873 transitions. Second operand 4 states. [2018-12-31 22:46:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:53,421 INFO L93 Difference]: Finished difference Result 132091 states and 421971 transitions. [2018-12-31 22:46:53,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:46:53,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-31 22:46:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:53,754 INFO L225 Difference]: With dead ends: 132091 [2018-12-31 22:46:53,754 INFO L226 Difference]: Without dead ends: 132091 [2018-12-31 22:46:53,755 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:46:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132091 states. [2018-12-31 22:46:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132091 to 128155. [2018-12-31 22:46:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128155 states. [2018-12-31 22:46:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128155 states to 128155 states and 410602 transitions. [2018-12-31 22:46:56,864 INFO L78 Accepts]: Start accepts. Automaton has 128155 states and 410602 transitions. Word has length 80 [2018-12-31 22:46:56,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:46:56,864 INFO L480 AbstractCegarLoop]: Abstraction has 128155 states and 410602 transitions. [2018-12-31 22:46:56,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:46:56,865 INFO L276 IsEmpty]: Start isEmpty. Operand 128155 states and 410602 transitions. [2018-12-31 22:46:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-31 22:46:56,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:46:56,906 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] [2018-12-31 22:46:56,907 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:46:56,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:46:56,907 INFO L82 PathProgramCache]: Analyzing trace with hash 132372790, now seen corresponding path program 1 times [2018-12-31 22:46:56,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:46:56,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:46:56,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:56,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:46:56,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:46:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:46:57,027 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:46:57,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:46:57,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:46:57,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:46:57,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:46:57,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:46:57,028 INFO L87 Difference]: Start difference. First operand 128155 states and 410602 transitions. Second operand 3 states. [2018-12-31 22:46:58,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:46:58,014 INFO L93 Difference]: Finished difference Result 129974 states and 415773 transitions. [2018-12-31 22:46:58,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:46:58,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-31 22:46:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:46:58,306 INFO L225 Difference]: With dead ends: 129974 [2018-12-31 22:46:58,306 INFO L226 Difference]: Without dead ends: 129974 [2018-12-31 22:46:58,306 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:46:58,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129974 states. [2018-12-31 22:47:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129974 to 129095. [2018-12-31 22:47:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129095 states. [2018-12-31 22:47:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129095 states to 129095 states and 413260 transitions. [2018-12-31 22:47:02,234 INFO L78 Accepts]: Start accepts. Automaton has 129095 states and 413260 transitions. Word has length 80 [2018-12-31 22:47:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:02,235 INFO L480 AbstractCegarLoop]: Abstraction has 129095 states and 413260 transitions. [2018-12-31 22:47:02,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:47:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 129095 states and 413260 transitions. [2018-12-31 22:47:02,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-31 22:47:02,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:02,284 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] [2018-12-31 22:47:02,286 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:02,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:02,286 INFO L82 PathProgramCache]: Analyzing trace with hash 394157484, now seen corresponding path program 1 times [2018-12-31 22:47:02,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:02,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:02,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:02,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:02,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:02,570 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 22:47:02,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:47:02,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:02,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:47:02,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:47:02,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:47:02,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:47:02,774 INFO L87 Difference]: Start difference. First operand 129095 states and 413260 transitions. Second operand 10 states. [2018-12-31 22:47:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:07,288 INFO L93 Difference]: Finished difference Result 169279 states and 531404 transitions. [2018-12-31 22:47:07,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-31 22:47:07,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-12-31 22:47:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:07,740 INFO L225 Difference]: With dead ends: 169279 [2018-12-31 22:47:07,741 INFO L226 Difference]: Without dead ends: 169203 [2018-12-31 22:47:07,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2018-12-31 22:47:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169203 states. [2018-12-31 22:47:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169203 to 127980. [2018-12-31 22:47:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127980 states. [2018-12-31 22:47:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127980 states to 127980 states and 410098 transitions. [2018-12-31 22:47:11,811 INFO L78 Accepts]: Start accepts. Automaton has 127980 states and 410098 transitions. Word has length 80 [2018-12-31 22:47:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:11,811 INFO L480 AbstractCegarLoop]: Abstraction has 127980 states and 410098 transitions. [2018-12-31 22:47:11,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:47:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 127980 states and 410098 transitions. [2018-12-31 22:47:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:47:11,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:11,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:11,874 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:11,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1341674495, now seen corresponding path program 1 times [2018-12-31 22:47:11,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:11,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:11,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:11,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:11,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:12,029 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:47:12,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:12,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:47:12,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:47:12,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:47:12,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:47:12,030 INFO L87 Difference]: Start difference. First operand 127980 states and 410098 transitions. Second operand 6 states. [2018-12-31 22:47:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:14,890 INFO L93 Difference]: Finished difference Result 139402 states and 443686 transitions. [2018-12-31 22:47:14,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:47:14,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-31 22:47:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:15,276 INFO L225 Difference]: With dead ends: 139402 [2018-12-31 22:47:15,277 INFO L226 Difference]: Without dead ends: 139402 [2018-12-31 22:47:15,277 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:47:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139402 states. [2018-12-31 22:47:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139402 to 135898. [2018-12-31 22:47:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135898 states. [2018-12-31 22:47:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135898 states to 135898 states and 433872 transitions. [2018-12-31 22:47:19,376 INFO L78 Accepts]: Start accepts. Automaton has 135898 states and 433872 transitions. Word has length 82 [2018-12-31 22:47:19,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:19,376 INFO L480 AbstractCegarLoop]: Abstraction has 135898 states and 433872 transitions. [2018-12-31 22:47:19,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:47:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 135898 states and 433872 transitions. [2018-12-31 22:47:19,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:47:19,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:19,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] [2018-12-31 22:47:19,421 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:19,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:19,422 INFO L82 PathProgramCache]: Analyzing trace with hash -593985792, now seen corresponding path program 1 times [2018-12-31 22:47:19,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:19,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:19,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:19,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:19,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:19,626 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:47:19,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:19,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:47:19,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:47:19,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:47:19,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:47:19,628 INFO L87 Difference]: Start difference. First operand 135898 states and 433872 transitions. Second operand 6 states. [2018-12-31 22:47:21,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:21,362 INFO L93 Difference]: Finished difference Result 143883 states and 451858 transitions. [2018-12-31 22:47:21,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:47:21,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-31 22:47:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:21,728 INFO L225 Difference]: With dead ends: 143883 [2018-12-31 22:47:21,728 INFO L226 Difference]: Without dead ends: 143883 [2018-12-31 22:47:21,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:47:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143883 states. [2018-12-31 22:47:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143883 to 138092. [2018-12-31 22:47:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138092 states. [2018-12-31 22:47:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138092 states to 138092 states and 437140 transitions. [2018-12-31 22:47:31,698 INFO L78 Accepts]: Start accepts. Automaton has 138092 states and 437140 transitions. Word has length 82 [2018-12-31 22:47:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:31,698 INFO L480 AbstractCegarLoop]: Abstraction has 138092 states and 437140 transitions. [2018-12-31 22:47:31,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:47:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 138092 states and 437140 transitions. [2018-12-31 22:47:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:47:31,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:31,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:31,745 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash -264220031, now seen corresponding path program 1 times [2018-12-31 22:47:31,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:31,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:31,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:31,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:31,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:31,998 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:47:31,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:31,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:47:31,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:47:31,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:47:31,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:31,999 INFO L87 Difference]: Start difference. First operand 138092 states and 437140 transitions. Second operand 5 states. [2018-12-31 22:47:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:33,514 INFO L93 Difference]: Finished difference Result 160064 states and 502579 transitions. [2018-12-31 22:47:33,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:47:33,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-31 22:47:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:33,941 INFO L225 Difference]: With dead ends: 160064 [2018-12-31 22:47:33,942 INFO L226 Difference]: Without dead ends: 160064 [2018-12-31 22:47:33,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:47:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160064 states. [2018-12-31 22:47:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160064 to 148241. [2018-12-31 22:47:36,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148241 states. [2018-12-31 22:47:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148241 states to 148241 states and 466166 transitions. [2018-12-31 22:47:38,188 INFO L78 Accepts]: Start accepts. Automaton has 148241 states and 466166 transitions. Word has length 82 [2018-12-31 22:47:38,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:38,188 INFO L480 AbstractCegarLoop]: Abstraction has 148241 states and 466166 transitions. [2018-12-31 22:47:38,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:47:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 148241 states and 466166 transitions. [2018-12-31 22:47:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:47:38,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:38,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:38,253 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2020643424, now seen corresponding path program 1 times [2018-12-31 22:47:38,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:38,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:38,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:38,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:38,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:38,498 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:47:38,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:38,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:47:38,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:47:38,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:47:38,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:38,499 INFO L87 Difference]: Start difference. First operand 148241 states and 466166 transitions. Second operand 5 states. [2018-12-31 22:47:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:40,296 INFO L93 Difference]: Finished difference Result 177929 states and 555113 transitions. [2018-12-31 22:47:40,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:47:40,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-31 22:47:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:40,816 INFO L225 Difference]: With dead ends: 177929 [2018-12-31 22:47:40,816 INFO L226 Difference]: Without dead ends: 177929 [2018-12-31 22:47:40,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 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:47:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177929 states. [2018-12-31 22:47:44,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177929 to 167311. [2018-12-31 22:47:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167311 states. [2018-12-31 22:47:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167311 states to 167311 states and 524219 transitions. [2018-12-31 22:47:45,416 INFO L78 Accepts]: Start accepts. Automaton has 167311 states and 524219 transitions. Word has length 82 [2018-12-31 22:47:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:45,417 INFO L480 AbstractCegarLoop]: Abstraction has 167311 states and 524219 transitions. [2018-12-31 22:47:45,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:47:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 167311 states and 524219 transitions. [2018-12-31 22:47:45,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:47:45,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:45,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:45,485 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:45,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:45,485 INFO L82 PathProgramCache]: Analyzing trace with hash -56565919, now seen corresponding path program 1 times [2018-12-31 22:47:45,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:45,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:45,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:45,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:45,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:45,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:45,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:47:45,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:47:45,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:47:45,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:45,687 INFO L87 Difference]: Start difference. First operand 167311 states and 524219 transitions. Second operand 4 states. [2018-12-31 22:47:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:47,774 INFO L93 Difference]: Finished difference Result 233999 states and 731439 transitions. [2018-12-31 22:47:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:47:47,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-31 22:47:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:48,411 INFO L225 Difference]: With dead ends: 233999 [2018-12-31 22:47:48,411 INFO L226 Difference]: Without dead ends: 233767 [2018-12-31 22:47:48,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233767 states. [2018-12-31 22:47:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233767 to 204343. [2018-12-31 22:47:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204343 states. [2018-12-31 22:47:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204343 states to 204343 states and 641541 transitions. [2018-12-31 22:47:53,680 INFO L78 Accepts]: Start accepts. Automaton has 204343 states and 641541 transitions. Word has length 82 [2018-12-31 22:47:53,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:53,681 INFO L480 AbstractCegarLoop]: Abstraction has 204343 states and 641541 transitions. [2018-12-31 22:47:53,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:47:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 204343 states and 641541 transitions. [2018-12-31 22:47:53,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:47:53,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:53,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:53,767 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:53,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:53,767 INFO L82 PathProgramCache]: Analyzing trace with hash 905048098, now seen corresponding path program 1 times [2018-12-31 22:47:53,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:53,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:53,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:53,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:53,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:53,875 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:47:53,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:53,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:47:53,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:47:53,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:47:53,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:53,876 INFO L87 Difference]: Start difference. First operand 204343 states and 641541 transitions. Second operand 5 states. [2018-12-31 22:47:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:53,995 INFO L93 Difference]: Finished difference Result 23915 states and 57980 transitions. [2018-12-31 22:47:53,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:47:53,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-31 22:47:53,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:54,020 INFO L225 Difference]: With dead ends: 23915 [2018-12-31 22:47:54,020 INFO L226 Difference]: Without dead ends: 19631 [2018-12-31 22:47:54,020 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:47:54,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19631 states. [2018-12-31 22:47:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19631 to 15169. [2018-12-31 22:47:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15169 states. [2018-12-31 22:47:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15169 states to 15169 states and 36124 transitions. [2018-12-31 22:47:54,237 INFO L78 Accepts]: Start accepts. Automaton has 15169 states and 36124 transitions. Word has length 82 [2018-12-31 22:47:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:54,237 INFO L480 AbstractCegarLoop]: Abstraction has 15169 states and 36124 transitions. [2018-12-31 22:47:54,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:47:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 15169 states and 36124 transitions. [2018-12-31 22:47:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-31 22:47:54,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:54,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:54,253 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:54,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:54,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1849176376, now seen corresponding path program 1 times [2018-12-31 22:47:54,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:54,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:54,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:54,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:54,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:54,527 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:47:54,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:54,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:47:54,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:47:54,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:47:54,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:47:54,528 INFO L87 Difference]: Start difference. First operand 15169 states and 36124 transitions. Second operand 6 states. [2018-12-31 22:47:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:55,016 INFO L93 Difference]: Finished difference Result 19266 states and 45758 transitions. [2018-12-31 22:47:55,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 22:47:55,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-12-31 22:47:55,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:55,044 INFO L225 Difference]: With dead ends: 19266 [2018-12-31 22:47:55,045 INFO L226 Difference]: Without dead ends: 19266 [2018-12-31 22:47:55,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:47:55,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19266 states. [2018-12-31 22:47:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19266 to 17553. [2018-12-31 22:47:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17553 states. [2018-12-31 22:47:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17553 states to 17553 states and 41871 transitions. [2018-12-31 22:47:55,302 INFO L78 Accepts]: Start accepts. Automaton has 17553 states and 41871 transitions. Word has length 88 [2018-12-31 22:47:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:55,302 INFO L480 AbstractCegarLoop]: Abstraction has 17553 states and 41871 transitions. [2018-12-31 22:47:55,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:47:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 17553 states and 41871 transitions. [2018-12-31 22:47:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-31 22:47:55,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:55,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:55,756 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:55,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:55,756 INFO L82 PathProgramCache]: Analyzing trace with hash -106366041, now seen corresponding path program 1 times [2018-12-31 22:47:55,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:55,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:55,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:55,923 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:47:55,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:55,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:47:55,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:47:55,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:47:55,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:47:55,925 INFO L87 Difference]: Start difference. First operand 17553 states and 41871 transitions. Second operand 8 states. [2018-12-31 22:47:56,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:56,868 INFO L93 Difference]: Finished difference Result 30070 states and 71891 transitions. [2018-12-31 22:47:56,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 22:47:56,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-12-31 22:47:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:56,913 INFO L225 Difference]: With dead ends: 30070 [2018-12-31 22:47:56,913 INFO L226 Difference]: Without dead ends: 29939 [2018-12-31 22:47:56,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-12-31 22:47:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29939 states. [2018-12-31 22:47:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29939 to 18668. [2018-12-31 22:47:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18668 states. [2018-12-31 22:47:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18668 states to 18668 states and 44244 transitions. [2018-12-31 22:47:57,210 INFO L78 Accepts]: Start accepts. Automaton has 18668 states and 44244 transitions. Word has length 88 [2018-12-31 22:47:57,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:57,210 INFO L480 AbstractCegarLoop]: Abstraction has 18668 states and 44244 transitions. [2018-12-31 22:47:57,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:47:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 18668 states and 44244 transitions. [2018-12-31 22:47:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-31 22:47:57,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:57,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:57,230 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:57,230 INFO L82 PathProgramCache]: Analyzing trace with hash -594830456, now seen corresponding path program 1 times [2018-12-31 22:47:57,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:57,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:57,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:57,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:57,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:57,438 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:47:57,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:57,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:47:57,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:47:57,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:47:57,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:47:57,439 INFO L87 Difference]: Start difference. First operand 18668 states and 44244 transitions. Second operand 6 states. [2018-12-31 22:47:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:57,777 INFO L93 Difference]: Finished difference Result 23727 states and 55950 transitions. [2018-12-31 22:47:57,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 22:47:57,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-12-31 22:47:57,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:57,810 INFO L225 Difference]: With dead ends: 23727 [2018-12-31 22:47:57,810 INFO L226 Difference]: Without dead ends: 23727 [2018-12-31 22:47:57,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:47:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23727 states. [2018-12-31 22:47:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23727 to 18663. [2018-12-31 22:47:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18663 states. [2018-12-31 22:47:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18663 states to 18663 states and 44222 transitions. [2018-12-31 22:47:58,076 INFO L78 Accepts]: Start accepts. Automaton has 18663 states and 44222 transitions. Word has length 88 [2018-12-31 22:47:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:58,076 INFO L480 AbstractCegarLoop]: Abstraction has 18663 states and 44222 transitions. [2018-12-31 22:47:58,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:47:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 18663 states and 44222 transitions. [2018-12-31 22:47:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-31 22:47:58,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:58,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:58,094 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:58,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:58,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1147979879, now seen corresponding path program 1 times [2018-12-31 22:47:58,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:58,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:58,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:58,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:58,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:58,289 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:47:58,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:58,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:47:58,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:47:58,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:47:58,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:47:58,290 INFO L87 Difference]: Start difference. First operand 18663 states and 44222 transitions. Second operand 10 states. [2018-12-31 22:47:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:59,800 INFO L93 Difference]: Finished difference Result 22808 states and 53530 transitions. [2018-12-31 22:47:59,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-31 22:47:59,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-12-31 22:47:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:59,832 INFO L225 Difference]: With dead ends: 22808 [2018-12-31 22:47:59,832 INFO L226 Difference]: Without dead ends: 22705 [2018-12-31 22:47:59,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-12-31 22:47:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22705 states. [2018-12-31 22:48:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22705 to 18449. [2018-12-31 22:48:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18449 states. [2018-12-31 22:48:00,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18449 states to 18449 states and 43783 transitions. [2018-12-31 22:48:00,092 INFO L78 Accepts]: Start accepts. Automaton has 18449 states and 43783 transitions. Word has length 88 [2018-12-31 22:48:00,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:00,093 INFO L480 AbstractCegarLoop]: Abstraction has 18449 states and 43783 transitions. [2018-12-31 22:48:00,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:48:00,093 INFO L276 IsEmpty]: Start isEmpty. Operand 18449 states and 43783 transitions. [2018-12-31 22:48:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 22:48:00,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:00,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:00,112 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:00,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:00,112 INFO L82 PathProgramCache]: Analyzing trace with hash -968928213, now seen corresponding path program 1 times [2018-12-31 22:48:00,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:00,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:00,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:00,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:00,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:00,352 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:48:00,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:00,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:00,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:00,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:00,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:00,354 INFO L87 Difference]: Start difference. First operand 18449 states and 43783 transitions. Second operand 7 states. [2018-12-31 22:48:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:00,873 INFO L93 Difference]: Finished difference Result 23334 states and 55287 transitions. [2018-12-31 22:48:00,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 22:48:00,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-31 22:48:00,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:00,907 INFO L225 Difference]: With dead ends: 23334 [2018-12-31 22:48:00,907 INFO L226 Difference]: Without dead ends: 23334 [2018-12-31 22:48:00,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-31 22:48:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23334 states. [2018-12-31 22:48:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23334 to 19012. [2018-12-31 22:48:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19012 states. [2018-12-31 22:48:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19012 states to 19012 states and 45122 transitions. [2018-12-31 22:48:01,166 INFO L78 Accepts]: Start accepts. Automaton has 19012 states and 45122 transitions. Word has length 100 [2018-12-31 22:48:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:01,167 INFO L480 AbstractCegarLoop]: Abstraction has 19012 states and 45122 transitions. [2018-12-31 22:48:01,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 19012 states and 45122 transitions. [2018-12-31 22:48:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 22:48:01,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:01,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:01,184 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:01,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:01,185 INFO L82 PathProgramCache]: Analyzing trace with hash 773882122, now seen corresponding path program 1 times [2018-12-31 22:48:01,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:01,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:01,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:01,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:01,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:01,416 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:48:01,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:01,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 22:48:01,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 22:48:01,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 22:48:01,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:48:01,418 INFO L87 Difference]: Start difference. First operand 19012 states and 45122 transitions. Second operand 11 states. [2018-12-31 22:48:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:03,419 INFO L93 Difference]: Finished difference Result 22944 states and 53962 transitions. [2018-12-31 22:48:03,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-31 22:48:03,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2018-12-31 22:48:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:03,451 INFO L225 Difference]: With dead ends: 22944 [2018-12-31 22:48:03,451 INFO L226 Difference]: Without dead ends: 22797 [2018-12-31 22:48:03,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2018-12-31 22:48:03,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22797 states. [2018-12-31 22:48:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22797 to 17633. [2018-12-31 22:48:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17633 states. [2018-12-31 22:48:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17633 states to 17633 states and 42135 transitions. [2018-12-31 22:48:03,705 INFO L78 Accepts]: Start accepts. Automaton has 17633 states and 42135 transitions. Word has length 100 [2018-12-31 22:48:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:03,705 INFO L480 AbstractCegarLoop]: Abstraction has 17633 states and 42135 transitions. [2018-12-31 22:48:03,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 22:48:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17633 states and 42135 transitions. [2018-12-31 22:48:03,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-31 22:48:03,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:03,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:03,726 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:03,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:03,726 INFO L82 PathProgramCache]: Analyzing trace with hash 606734028, now seen corresponding path program 1 times [2018-12-31 22:48:03,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:03,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:03,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:03,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:03,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:03,848 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:48:03,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:03,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:03,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:03,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:03,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:03,850 INFO L87 Difference]: Start difference. First operand 17633 states and 42135 transitions. Second operand 4 states. [2018-12-31 22:48:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:04,523 INFO L93 Difference]: Finished difference Result 28969 states and 68380 transitions. [2018-12-31 22:48:04,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:48:04,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-31 22:48:04,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:04,564 INFO L225 Difference]: With dead ends: 28969 [2018-12-31 22:48:04,565 INFO L226 Difference]: Without dead ends: 28969 [2018-12-31 22:48:04,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28969 states. [2018-12-31 22:48:04,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28969 to 21567. [2018-12-31 22:48:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21567 states. [2018-12-31 22:48:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21567 states to 21567 states and 50748 transitions. [2018-12-31 22:48:04,981 INFO L78 Accepts]: Start accepts. Automaton has 21567 states and 50748 transitions. Word has length 123 [2018-12-31 22:48:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:04,981 INFO L480 AbstractCegarLoop]: Abstraction has 21567 states and 50748 transitions. [2018-12-31 22:48:04,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 21567 states and 50748 transitions. [2018-12-31 22:48:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-31 22:48:05,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:05,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:05,005 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:05,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:05,005 INFO L82 PathProgramCache]: Analyzing trace with hash 8010884, now seen corresponding path program 2 times [2018-12-31 22:48:05,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:05,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:05,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:05,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:05,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:05,182 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:48:05,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:05,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:05,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:05,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:05,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:05,184 INFO L87 Difference]: Start difference. First operand 21567 states and 50748 transitions. Second operand 5 states. [2018-12-31 22:48:05,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:05,556 INFO L93 Difference]: Finished difference Result 30780 states and 71676 transitions. [2018-12-31 22:48:05,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:48:05,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2018-12-31 22:48:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:05,599 INFO L225 Difference]: With dead ends: 30780 [2018-12-31 22:48:05,599 INFO L226 Difference]: Without dead ends: 30780 [2018-12-31 22:48:05,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:05,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30780 states. [2018-12-31 22:48:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30780 to 28452. [2018-12-31 22:48:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28452 states. [2018-12-31 22:48:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28452 states to 28452 states and 66758 transitions. [2018-12-31 22:48:05,989 INFO L78 Accepts]: Start accepts. Automaton has 28452 states and 66758 transitions. Word has length 123 [2018-12-31 22:48:05,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:05,989 INFO L480 AbstractCegarLoop]: Abstraction has 28452 states and 66758 transitions. [2018-12-31 22:48:05,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 28452 states and 66758 transitions. [2018-12-31 22:48:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-31 22:48:06,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:06,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:06,025 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:06,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1975294286, now seen corresponding path program 1 times [2018-12-31 22:48:06,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:06,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:06,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:48:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:06,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:06,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:06,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:06,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:06,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:06,185 INFO L87 Difference]: Start difference. First operand 28452 states and 66758 transitions. Second operand 6 states. [2018-12-31 22:48:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:06,890 INFO L93 Difference]: Finished difference Result 31313 states and 73508 transitions. [2018-12-31 22:48:06,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:06,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-31 22:48:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:06,938 INFO L225 Difference]: With dead ends: 31313 [2018-12-31 22:48:06,938 INFO L226 Difference]: Without dead ends: 31281 [2018-12-31 22:48:06,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:48:06,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31281 states. [2018-12-31 22:48:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31281 to 29566. [2018-12-31 22:48:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29566 states. [2018-12-31 22:48:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29566 states to 29566 states and 69375 transitions. [2018-12-31 22:48:07,355 INFO L78 Accepts]: Start accepts. Automaton has 29566 states and 69375 transitions. Word has length 125 [2018-12-31 22:48:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:07,355 INFO L480 AbstractCegarLoop]: Abstraction has 29566 states and 69375 transitions. [2018-12-31 22:48:07,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 29566 states and 69375 transitions. [2018-12-31 22:48:07,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-31 22:48:07,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:07,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:07,395 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:07,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:07,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1013680269, now seen corresponding path program 1 times [2018-12-31 22:48:07,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:07,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:07,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:07,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:07,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:08,239 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-12-31 22:48:08,286 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:48:08,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:08,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:08,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:08,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:08,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:08,287 INFO L87 Difference]: Start difference. First operand 29566 states and 69375 transitions. Second operand 7 states. [2018-12-31 22:48:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:10,303 INFO L93 Difference]: Finished difference Result 36262 states and 84404 transitions. [2018-12-31 22:48:10,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:10,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-12-31 22:48:10,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:10,353 INFO L225 Difference]: With dead ends: 36262 [2018-12-31 22:48:10,353 INFO L226 Difference]: Without dead ends: 36262 [2018-12-31 22:48:10,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36262 states. [2018-12-31 22:48:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36262 to 30163. [2018-12-31 22:48:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30163 states. [2018-12-31 22:48:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30163 states to 30163 states and 71030 transitions. [2018-12-31 22:48:10,777 INFO L78 Accepts]: Start accepts. Automaton has 30163 states and 71030 transitions. Word has length 125 [2018-12-31 22:48:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:10,778 INFO L480 AbstractCegarLoop]: Abstraction has 30163 states and 71030 transitions. [2018-12-31 22:48:10,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 30163 states and 71030 transitions. [2018-12-31 22:48:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-31 22:48:10,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:10,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:10,812 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:10,812 INFO L82 PathProgramCache]: Analyzing trace with hash 187820790, now seen corresponding path program 1 times [2018-12-31 22:48:10,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:10,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:10,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:10,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:10,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:11,289 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:48:11,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:11,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:11,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:11,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:11,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:11,293 INFO L87 Difference]: Start difference. First operand 30163 states and 71030 transitions. Second operand 6 states. [2018-12-31 22:48:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:11,694 INFO L93 Difference]: Finished difference Result 46635 states and 109284 transitions. [2018-12-31 22:48:11,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:48:11,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-31 22:48:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:11,753 INFO L225 Difference]: With dead ends: 46635 [2018-12-31 22:48:11,754 INFO L226 Difference]: Without dead ends: 46635 [2018-12-31 22:48:11,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:48:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46635 states. [2018-12-31 22:48:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46635 to 30337. [2018-12-31 22:48:12,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30337 states. [2018-12-31 22:48:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30337 states to 30337 states and 71509 transitions. [2018-12-31 22:48:12,206 INFO L78 Accepts]: Start accepts. Automaton has 30337 states and 71509 transitions. Word has length 125 [2018-12-31 22:48:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:12,206 INFO L480 AbstractCegarLoop]: Abstraction has 30337 states and 71509 transitions. [2018-12-31 22:48:12,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 30337 states and 71509 transitions. [2018-12-31 22:48:12,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-31 22:48:12,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:12,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:12,245 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:12,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:12,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1798487148, now seen corresponding path program 1 times [2018-12-31 22:48:12,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:12,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:12,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:12,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:12,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:12,552 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:48:12,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:12,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:12,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:12,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:12,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:12,554 INFO L87 Difference]: Start difference. First operand 30337 states and 71509 transitions. Second operand 5 states. [2018-12-31 22:48:12,737 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-31 22:48:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:15,129 INFO L93 Difference]: Finished difference Result 45324 states and 106532 transitions. [2018-12-31 22:48:15,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:48:15,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2018-12-31 22:48:15,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:15,185 INFO L225 Difference]: With dead ends: 45324 [2018-12-31 22:48:15,185 INFO L226 Difference]: Without dead ends: 45227 [2018-12-31 22:48:15,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:48:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45227 states. [2018-12-31 22:48:15,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45227 to 34899. [2018-12-31 22:48:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34899 states. [2018-12-31 22:48:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34899 states to 34899 states and 82362 transitions. [2018-12-31 22:48:15,700 INFO L78 Accepts]: Start accepts. Automaton has 34899 states and 82362 transitions. Word has length 125 [2018-12-31 22:48:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:15,700 INFO L480 AbstractCegarLoop]: Abstraction has 34899 states and 82362 transitions. [2018-12-31 22:48:15,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 34899 states and 82362 transitions. [2018-12-31 22:48:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-31 22:48:15,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:15,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:15,737 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:15,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:15,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1573796565, now seen corresponding path program 1 times [2018-12-31 22:48:15,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:15,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:15,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:15,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:15,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:16,310 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:48:16,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:16,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:16,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:16,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:16,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:16,315 INFO L87 Difference]: Start difference. First operand 34899 states and 82362 transitions. Second operand 6 states. [2018-12-31 22:48:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:17,170 INFO L93 Difference]: Finished difference Result 39714 states and 92860 transitions. [2018-12-31 22:48:17,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:48:17,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-31 22:48:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:17,229 INFO L225 Difference]: With dead ends: 39714 [2018-12-31 22:48:17,229 INFO L226 Difference]: Without dead ends: 39589 [2018-12-31 22:48:17,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:48:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39589 states. [2018-12-31 22:48:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39589 to 34743. [2018-12-31 22:48:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34743 states. [2018-12-31 22:48:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34743 states to 34743 states and 81992 transitions. [2018-12-31 22:48:17,727 INFO L78 Accepts]: Start accepts. Automaton has 34743 states and 81992 transitions. Word has length 125 [2018-12-31 22:48:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:17,728 INFO L480 AbstractCegarLoop]: Abstraction has 34743 states and 81992 transitions. [2018-12-31 22:48:17,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 34743 states and 81992 transitions. [2018-12-31 22:48:17,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-31 22:48:17,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:17,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:17,769 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:17,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash -84392749, now seen corresponding path program 1 times [2018-12-31 22:48:17,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:17,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:17,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:17,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:17,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:17,938 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:48:17,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:17,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:17,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:17,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:17,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:17,939 INFO L87 Difference]: Start difference. First operand 34743 states and 81992 transitions. Second operand 7 states. [2018-12-31 22:48:19,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:19,109 INFO L93 Difference]: Finished difference Result 40237 states and 93924 transitions. [2018-12-31 22:48:19,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:48:19,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-12-31 22:48:19,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:19,168 INFO L225 Difference]: With dead ends: 40237 [2018-12-31 22:48:19,168 INFO L226 Difference]: Without dead ends: 40237 [2018-12-31 22:48:19,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:48:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40237 states. [2018-12-31 22:48:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40237 to 36222. [2018-12-31 22:48:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36222 states. [2018-12-31 22:48:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36222 states to 36222 states and 85281 transitions. [2018-12-31 22:48:19,663 INFO L78 Accepts]: Start accepts. Automaton has 36222 states and 85281 transitions. Word has length 125 [2018-12-31 22:48:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:19,664 INFO L480 AbstractCegarLoop]: Abstraction has 36222 states and 85281 transitions. [2018-12-31 22:48:19,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 36222 states and 85281 transitions. [2018-12-31 22:48:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-31 22:48:19,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:19,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:19,711 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:19,712 INFO L82 PathProgramCache]: Analyzing trace with hash -31288016, now seen corresponding path program 1 times [2018-12-31 22:48:19,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:19,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:19,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:19,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:19,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:20,428 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:48:20,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:20,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:48:20,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:48:20,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:48:20,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:20,430 INFO L87 Difference]: Start difference. First operand 36222 states and 85281 transitions. Second operand 8 states. [2018-12-31 22:48:21,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:21,507 INFO L93 Difference]: Finished difference Result 46779 states and 108852 transitions. [2018-12-31 22:48:21,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:48:21,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2018-12-31 22:48:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:21,581 INFO L225 Difference]: With dead ends: 46779 [2018-12-31 22:48:21,581 INFO L226 Difference]: Without dead ends: 46747 [2018-12-31 22:48:21,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-31 22:48:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46747 states. [2018-12-31 22:48:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46747 to 42463. [2018-12-31 22:48:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42463 states. [2018-12-31 22:48:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42463 states to 42463 states and 99073 transitions. [2018-12-31 22:48:22,608 INFO L78 Accepts]: Start accepts. Automaton has 42463 states and 99073 transitions. Word has length 125 [2018-12-31 22:48:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:22,608 INFO L480 AbstractCegarLoop]: Abstraction has 42463 states and 99073 transitions. [2018-12-31 22:48:22,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:48:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand 42463 states and 99073 transitions. [2018-12-31 22:48:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-31 22:48:22,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:22,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:22,661 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:22,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:22,662 INFO L82 PathProgramCache]: Analyzing trace with hash 930326001, now seen corresponding path program 1 times [2018-12-31 22:48:22,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:22,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:22,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:22,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:22,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:22,803 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:48:22,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:22,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:22,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:22,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:22,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:22,804 INFO L87 Difference]: Start difference. First operand 42463 states and 99073 transitions. Second operand 6 states. [2018-12-31 22:48:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:23,197 INFO L93 Difference]: Finished difference Result 42191 states and 98201 transitions. [2018-12-31 22:48:23,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:23,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-31 22:48:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:23,257 INFO L225 Difference]: With dead ends: 42191 [2018-12-31 22:48:23,257 INFO L226 Difference]: Without dead ends: 42191 [2018-12-31 22:48:23,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42191 states. [2018-12-31 22:48:23,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42191 to 35604. [2018-12-31 22:48:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35604 states. [2018-12-31 22:48:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35604 states to 35604 states and 83440 transitions. [2018-12-31 22:48:23,862 INFO L78 Accepts]: Start accepts. Automaton has 35604 states and 83440 transitions. Word has length 125 [2018-12-31 22:48:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:23,862 INFO L480 AbstractCegarLoop]: Abstraction has 35604 states and 83440 transitions. [2018-12-31 22:48:23,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 35604 states and 83440 transitions. [2018-12-31 22:48:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-31 22:48:23,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:23,919 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:23,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:23,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1892787005, now seen corresponding path program 1 times [2018-12-31 22:48:23,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:23,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:23,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:23,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:23,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:24,113 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:48:24,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:24,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:24,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:24,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:24,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:24,114 INFO L87 Difference]: Start difference. First operand 35604 states and 83440 transitions. Second operand 5 states. [2018-12-31 22:48:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:24,527 INFO L93 Difference]: Finished difference Result 36052 states and 84544 transitions. [2018-12-31 22:48:24,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:24,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-31 22:48:24,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:24,583 INFO L225 Difference]: With dead ends: 36052 [2018-12-31 22:48:24,583 INFO L226 Difference]: Without dead ends: 36020 [2018-12-31 22:48:24,584 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:48:24,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36020 states. [2018-12-31 22:48:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36020 to 35652. [2018-12-31 22:48:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35652 states. [2018-12-31 22:48:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35652 states to 35652 states and 83544 transitions. [2018-12-31 22:48:25,069 INFO L78 Accepts]: Start accepts. Automaton has 35652 states and 83544 transitions. Word has length 127 [2018-12-31 22:48:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:25,069 INFO L480 AbstractCegarLoop]: Abstraction has 35652 states and 83544 transitions. [2018-12-31 22:48:25,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 35652 states and 83544 transitions. [2018-12-31 22:48:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-31 22:48:25,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:25,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:25,111 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:25,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1157415810, now seen corresponding path program 1 times [2018-12-31 22:48:25,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:25,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:25,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:25,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:25,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:25,341 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:48:25,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:25,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:25,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:25,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:25,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:25,343 INFO L87 Difference]: Start difference. First operand 35652 states and 83544 transitions. Second operand 4 states. [2018-12-31 22:48:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:25,969 INFO L93 Difference]: Finished difference Result 37437 states and 87287 transitions. [2018-12-31 22:48:25,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:48:25,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-31 22:48:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:26,022 INFO L225 Difference]: With dead ends: 37437 [2018-12-31 22:48:26,022 INFO L226 Difference]: Without dead ends: 37370 [2018-12-31 22:48:26,022 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:48:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37370 states. [2018-12-31 22:48:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37370 to 35931. [2018-12-31 22:48:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35931 states. [2018-12-31 22:48:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35931 states to 35931 states and 84099 transitions. [2018-12-31 22:48:26,504 INFO L78 Accepts]: Start accepts. Automaton has 35931 states and 84099 transitions. Word has length 127 [2018-12-31 22:48:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:26,505 INFO L480 AbstractCegarLoop]: Abstraction has 35931 states and 84099 transitions. [2018-12-31 22:48:26,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 35931 states and 84099 transitions. [2018-12-31 22:48:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-31 22:48:26,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:26,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:26,548 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:26,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:26,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1201891199, now seen corresponding path program 1 times [2018-12-31 22:48:26,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:26,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:26,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:26,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:26,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:26,751 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:48:26,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:26,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 22:48:26,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 22:48:26,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 22:48:26,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:48:26,752 INFO L87 Difference]: Start difference. First operand 35931 states and 84099 transitions. Second operand 11 states. [2018-12-31 22:48:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:30,136 INFO L93 Difference]: Finished difference Result 100338 states and 233848 transitions. [2018-12-31 22:48:30,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-31 22:48:30,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2018-12-31 22:48:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:30,265 INFO L225 Difference]: With dead ends: 100338 [2018-12-31 22:48:30,266 INFO L226 Difference]: Without dead ends: 74838 [2018-12-31 22:48:30,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2018-12-31 22:48:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74838 states. [2018-12-31 22:48:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74838 to 35289. [2018-12-31 22:48:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35289 states. [2018-12-31 22:48:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35289 states to 35289 states and 82617 transitions. [2018-12-31 22:48:31,213 INFO L78 Accepts]: Start accepts. Automaton has 35289 states and 82617 transitions. Word has length 127 [2018-12-31 22:48:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:31,213 INFO L480 AbstractCegarLoop]: Abstraction has 35289 states and 82617 transitions. [2018-12-31 22:48:31,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 22:48:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 35289 states and 82617 transitions. [2018-12-31 22:48:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-31 22:48:31,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:31,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:31,253 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:31,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:31,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1488351502, now seen corresponding path program 1 times [2018-12-31 22:48:31,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:31,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:31,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:31,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:31,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:31,747 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:48:31,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:31,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:31,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:31,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:31,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:31,748 INFO L87 Difference]: Start difference. First operand 35289 states and 82617 transitions. Second operand 6 states. [2018-12-31 22:48:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:32,356 INFO L93 Difference]: Finished difference Result 34869 states and 81471 transitions. [2018-12-31 22:48:32,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:32,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-31 22:48:32,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:32,406 INFO L225 Difference]: With dead ends: 34869 [2018-12-31 22:48:32,406 INFO L226 Difference]: Without dead ends: 34869 [2018-12-31 22:48:32,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34869 states. [2018-12-31 22:48:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34869 to 32617. [2018-12-31 22:48:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32617 states. [2018-12-31 22:48:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32617 states to 32617 states and 76311 transitions. [2018-12-31 22:48:32,866 INFO L78 Accepts]: Start accepts. Automaton has 32617 states and 76311 transitions. Word has length 127 [2018-12-31 22:48:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:32,866 INFO L480 AbstractCegarLoop]: Abstraction has 32617 states and 76311 transitions. [2018-12-31 22:48:32,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 32617 states and 76311 transitions. [2018-12-31 22:48:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-31 22:48:32,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:32,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:32,910 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:32,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:32,910 INFO L82 PathProgramCache]: Analyzing trace with hash 893789617, now seen corresponding path program 2 times [2018-12-31 22:48:32,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:32,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:32,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:32,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:32,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:33,147 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 22:48:33,511 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:48:33,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:33,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:33,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:33,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:33,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:33,512 INFO L87 Difference]: Start difference. First operand 32617 states and 76311 transitions. Second operand 7 states. [2018-12-31 22:48:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:34,632 INFO L93 Difference]: Finished difference Result 52305 states and 122358 transitions. [2018-12-31 22:48:34,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:34,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-12-31 22:48:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:34,659 INFO L225 Difference]: With dead ends: 52305 [2018-12-31 22:48:34,659 INFO L226 Difference]: Without dead ends: 18006 [2018-12-31 22:48:34,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:48:34,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18006 states. [2018-12-31 22:48:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18006 to 18006. [2018-12-31 22:48:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18006 states. [2018-12-31 22:48:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18006 states to 18006 states and 42476 transitions. [2018-12-31 22:48:34,888 INFO L78 Accepts]: Start accepts. Automaton has 18006 states and 42476 transitions. Word has length 127 [2018-12-31 22:48:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:34,889 INFO L480 AbstractCegarLoop]: Abstraction has 18006 states and 42476 transitions. [2018-12-31 22:48:34,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 18006 states and 42476 transitions. [2018-12-31 22:48:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-31 22:48:34,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:34,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:34,913 INFO L423 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:34,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash 528390363, now seen corresponding path program 3 times [2018-12-31 22:48:34,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:34,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:34,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:34,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:48:34,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:35,127 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 22:48:35,256 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:48:35,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:35,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-31 22:48:35,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 22:48:35,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 22:48:35,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-31 22:48:35,258 INFO L87 Difference]: Start difference. First operand 18006 states and 42476 transitions. Second operand 15 states. [2018-12-31 22:48:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:36,585 INFO L93 Difference]: Finished difference Result 38229 states and 90519 transitions. [2018-12-31 22:48:36,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 22:48:36,587 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 127 [2018-12-31 22:48:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:36,637 INFO L225 Difference]: With dead ends: 38229 [2018-12-31 22:48:36,637 INFO L226 Difference]: Without dead ends: 36576 [2018-12-31 22:48:36,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-12-31 22:48:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36576 states. [2018-12-31 22:48:37,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36576 to 31227. [2018-12-31 22:48:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31227 states. [2018-12-31 22:48:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31227 states to 31227 states and 73259 transitions. [2018-12-31 22:48:37,088 INFO L78 Accepts]: Start accepts. Automaton has 31227 states and 73259 transitions. Word has length 127 [2018-12-31 22:48:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:37,088 INFO L480 AbstractCegarLoop]: Abstraction has 31227 states and 73259 transitions. [2018-12-31 22:48:37,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 22:48:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 31227 states and 73259 transitions. [2018-12-31 22:48:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-31 22:48:37,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:37,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:37,127 INFO L423 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:37,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:37,127 INFO L82 PathProgramCache]: Analyzing trace with hash 520631004, now seen corresponding path program 1 times [2018-12-31 22:48:37,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:37,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:37,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:37,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:48:37,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:37,276 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:48:37,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:37,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:37,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:37,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:37,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:37,278 INFO L87 Difference]: Start difference. First operand 31227 states and 73259 transitions. Second operand 5 states. [2018-12-31 22:48:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:37,501 INFO L93 Difference]: Finished difference Result 25684 states and 59945 transitions. [2018-12-31 22:48:37,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:48:37,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-31 22:48:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:37,539 INFO L225 Difference]: With dead ends: 25684 [2018-12-31 22:48:37,539 INFO L226 Difference]: Without dead ends: 25684 [2018-12-31 22:48:37,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25684 states. [2018-12-31 22:48:37,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25684 to 25511. [2018-12-31 22:48:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25511 states. [2018-12-31 22:48:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25511 states to 25511 states and 59583 transitions. [2018-12-31 22:48:37,861 INFO L78 Accepts]: Start accepts. Automaton has 25511 states and 59583 transitions. Word has length 127 [2018-12-31 22:48:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:37,861 INFO L480 AbstractCegarLoop]: Abstraction has 25511 states and 59583 transitions. [2018-12-31 22:48:37,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 25511 states and 59583 transitions. [2018-12-31 22:48:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-31 22:48:37,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:37,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:37,892 INFO L423 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:37,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:37,892 INFO L82 PathProgramCache]: Analyzing trace with hash 220817658, now seen corresponding path program 2 times [2018-12-31 22:48:37,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:37,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:37,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:37,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:37,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:38,303 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-31 22:48:38,315 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:48:38,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:38,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:48:38,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:48:38,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:48:38,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:38,316 INFO L87 Difference]: Start difference. First operand 25511 states and 59583 transitions. Second operand 8 states. [2018-12-31 22:48:39,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:39,187 INFO L93 Difference]: Finished difference Result 28185 states and 65583 transitions. [2018-12-31 22:48:39,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 22:48:39,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-12-31 22:48:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:39,227 INFO L225 Difference]: With dead ends: 28185 [2018-12-31 22:48:39,227 INFO L226 Difference]: Without dead ends: 28185 [2018-12-31 22:48:39,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-31 22:48:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2018-12-31 22:48:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 27037. [2018-12-31 22:48:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27037 states. [2018-12-31 22:48:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27037 states to 27037 states and 63098 transitions. [2018-12-31 22:48:39,563 INFO L78 Accepts]: Start accepts. Automaton has 27037 states and 63098 transitions. Word has length 127 [2018-12-31 22:48:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:39,564 INFO L480 AbstractCegarLoop]: Abstraction has 27037 states and 63098 transitions. [2018-12-31 22:48:39,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:48:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 27037 states and 63098 transitions. [2018-12-31 22:48:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-31 22:48:39,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:39,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:39,596 INFO L423 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:39,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:39,596 INFO L82 PathProgramCache]: Analyzing trace with hash 45331485, now seen corresponding path program 4 times [2018-12-31 22:48:39,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:39,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:39,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:39,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:48:39,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:48:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:48:39,719 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 22:48:40,013 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 22:48:40,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:48:40 BasicIcfg [2018-12-31 22:48:40,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 22:48:40,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 22:48:40,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 22:48:40,019 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 22:48:40,021 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:45:23" (3/4) ... [2018-12-31 22:48:40,025 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 22:48:40,305 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 22:48:40,305 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 22:48:40,306 INFO L168 Benchmark]: Toolchain (without parser) took 200045.12 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 952.7 MB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-31 22:48:40,309 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:48:40,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 946.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2018-12-31 22:48:40,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.64 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:48:40,312 INFO L168 Benchmark]: Boogie Preprocessor took 68.77 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:48:40,312 INFO L168 Benchmark]: RCFGBuilder took 2080.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.6 MB). Peak memory consumption was 72.6 MB. Max. memory is 11.5 GB. [2018-12-31 22:48:40,312 INFO L168 Benchmark]: TraceAbstraction took 196555.70 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-31 22:48:40,313 INFO L168 Benchmark]: Witness Printer took 287.23 ms. Allocated memory is still 6.4 GB. Free memory was 3.6 GB in the beginning and 3.6 GB in the end (delta: 87.0 MB). Peak memory consumption was 87.0 MB. Max. memory is 11.5 GB. [2018-12-31 22:48:40,318 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 946.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.77 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 2080.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.6 MB). Peak memory consumption was 72.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 196555.70 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 287.23 ms. Allocated memory is still 6.4 GB. Free memory was 3.6 GB in the beginning and 3.6 GB in the end (delta: 87.0 MB). Peak memory consumption was 87.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=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] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=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] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=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] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L789] -1 pthread_t t1591; VAL [__unbuffered_cnt=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] [L790] FCALL, FORK -1 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 2 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 pthread_t t1592; VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK -1 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 x = 1 VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 2 [L732] 1 y = 1 [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y = y$flush_delayed ? y$mem_tmp : y [L748] 1 y$flush_delayed = (_Bool)0 [L751] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L752] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L753] 1 y$flush_delayed = weak$$choice2 [L754] 1 y$mem_tmp = y VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 y = y$flush_delayed ? y$mem_tmp : y [L764] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1] [L767] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1] [L767] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -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) [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] -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 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] -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 [L805] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L806] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L807] -1 y$flush_delayed = weak$$choice2 [L808] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] -1 y = y$flush_delayed ? y$mem_tmp : y [L818] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 348 locations, 3 error locations. UNSAFE Result, 196.3s OverallTime, 44 OverallIterations, 1 TraceHistogramMax, 72.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24301 SDtfs, 22754 SDslu, 73102 SDs, 0 SdLazy, 28796 SolverSat, 1158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 597 GetRequests, 141 SyntacticMatches, 32 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204343occurred in iteration=18, 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: 87.3s AutomataMinimizationTime, 43 MinimizatonAttempts, 584540 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 4253 NumberOfCodeBlocks, 4253 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 4083 ConstructedInterpolants, 0 QuantifiedInterpolants, 1015239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...