./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix041_power.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 424d85e81579c93fea3149876316172742bff15d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 20:05:43,331 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:05:43,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:05:43,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:05:43,350 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:05:43,351 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:05:43,353 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:05:43,355 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:05:43,358 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:05:43,359 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:05:43,362 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:05:43,362 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:05:43,363 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:05:43,364 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:05:43,367 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:05:43,368 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:05:43,369 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:05:43,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:05:43,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:05:43,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:05:43,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:05:43,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:05:43,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:05:43,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:05:43,392 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:05:43,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:05:43,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:05:43,395 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:05:43,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:05:43,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:05:43,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:05:43,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:05:43,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:05:43,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:05:43,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:05:43,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:05:43,402 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 20:05:43,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:05:43,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:05:43,418 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:05:43,418 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:05:43,420 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:05:43,420 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:05:43,420 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:05:43,420 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:05:43,420 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:05:43,421 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:05:43,421 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:05:43,421 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:05:43,421 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:05:43,421 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:05:43,421 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:05:43,423 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:05:43,423 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:05:43,423 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:05:43,423 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:05:43,424 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:05:43,424 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:05:43,424 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:05:43,424 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:05:43,424 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:05:43,426 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:05:43,426 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:05:43,426 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:05:43,426 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:05:43,427 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:05:43,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:05:43,427 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 -> 424d85e81579c93fea3149876316172742bff15d [2018-11-28 20:05:43,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:05:43,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:05:43,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:05:43,494 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:05:43,495 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:05:43,495 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i [2018-11-28 20:05:43,562 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a008b78/5918ee82a6014b9aa996d7936ec02c2f/FLAGeec1991ad [2018-11-28 20:05:44,086 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:05:44,086 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i [2018-11-28 20:05:44,106 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a008b78/5918ee82a6014b9aa996d7936ec02c2f/FLAGeec1991ad [2018-11-28 20:05:44,390 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a008b78/5918ee82a6014b9aa996d7936ec02c2f [2018-11-28 20:05:44,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:05:44,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:05:44,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:05:44,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:05:44,400 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:05:44,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:05:44" (1/1) ... [2018-11-28 20:05:44,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf30235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:05:44, skipping insertion in model container [2018-11-28 20:05:44,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:05:44" (1/1) ... [2018-11-28 20:05:44,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:05:44,466 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:05:44,912 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:05:44,926 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:05:45,100 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:05:45,178 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:05:45,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:05:45 WrapperNode [2018-11-28 20:05:45,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:05:45,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:05:45,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:05:45,181 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:05:45,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:05:45" (1/1) ... [2018-11-28 20:05:45,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:05:45" (1/1) ... [2018-11-28 20:05:45,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:05:45,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:05:45,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:05:45,257 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:05:45,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:05:45" (1/1) ... [2018-11-28 20:05:45,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:05:45" (1/1) ... [2018-11-28 20:05:45,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:05:45" (1/1) ... [2018-11-28 20:05:45,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:05:45" (1/1) ... [2018-11-28 20:05:45,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:05:45" (1/1) ... [2018-11-28 20:05:45,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:05:45" (1/1) ... [2018-11-28 20:05:45,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:05:45" (1/1) ... [2018-11-28 20:05:45,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:05:45,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:05:45,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:05:45,303 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:05:45,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:05:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:05:45,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:05:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:05:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:05:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:05:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:05:45,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:05:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:05:45,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:05:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:05:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:05:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:05:45,370 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 20:05:46,499 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:05:46,499 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:05:46,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:05:46 BoogieIcfgContainer [2018-11-28 20:05:46,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:05:46,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:05:46,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:05:46,508 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:05:46,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:05:44" (1/3) ... [2018-11-28 20:05:46,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de82ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:05:46, skipping insertion in model container [2018-11-28 20:05:46,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:05:45" (2/3) ... [2018-11-28 20:05:46,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de82ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:05:46, skipping insertion in model container [2018-11-28 20:05:46,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:05:46" (3/3) ... [2018-11-28 20:05:46,514 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_false-unreach-call.i [2018-11-28 20:05:46,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,577 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,577 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,577 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,578 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,578 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,584 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,584 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,584 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,584 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,584 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,586 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,588 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,589 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:05:46,632 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:05:46,633 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:05:46,643 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:05:46,662 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:05:46,688 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:05:46,688 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:05:46,688 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:05:46,689 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:05:46,689 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:05:46,689 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:05:46,689 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:05:46,689 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:05:46,689 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:05:46,706 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-11-28 20:05:49,289 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-11-28 20:05:49,291 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-11-28 20:05:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 20:05:49,300 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:05:49,302 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] [2018-11-28 20:05:49,305 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:05:49,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:05:49,313 INFO L82 PathProgramCache]: Analyzing trace with hash 375373260, now seen corresponding path program 1 times [2018-11-28 20:05:49,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:05:49,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:05:49,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:49,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:05:49,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:05:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:05:49,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:05:49,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:05:49,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:05:49,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:05:49,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:05:49,757 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-11-28 20:05:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:05:51,035 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-11-28 20:05:51,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:05:51,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-28 20:05:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:05:51,382 INFO L225 Difference]: With dead ends: 60791 [2018-11-28 20:05:51,382 INFO L226 Difference]: Without dead ends: 44271 [2018-11-28 20:05:51,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:05:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-11-28 20:05:53,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-11-28 20:05:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-11-28 20:05:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-11-28 20:05:53,179 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-11-28 20:05:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:05:53,179 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-11-28 20:05:53,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:05:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-11-28 20:05:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 20:05:53,193 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:05:53,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:05:53,197 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:05:53,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:05:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash 510140563, now seen corresponding path program 1 times [2018-11-28 20:05:53,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:05:53,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:05:53,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:53,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:05:53,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:05:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:05:53,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:05:53,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:05:53,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:05:53,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:05:53,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:05:53,436 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 4 states. [2018-11-28 20:05:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:05:53,804 INFO L93 Difference]: Finished difference Result 8529 states and 28345 transitions. [2018-11-28 20:05:53,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:05:53,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-28 20:05:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:05:53,840 INFO L225 Difference]: With dead ends: 8529 [2018-11-28 20:05:53,840 INFO L226 Difference]: Without dead ends: 7467 [2018-11-28 20:05:53,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:05:53,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2018-11-28 20:05:54,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7467. [2018-11-28 20:05:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7467 states. [2018-11-28 20:05:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7467 states to 7467 states and 24637 transitions. [2018-11-28 20:05:54,067 INFO L78 Accepts]: Start accepts. Automaton has 7467 states and 24637 transitions. Word has length 46 [2018-11-28 20:05:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:05:54,067 INFO L480 AbstractCegarLoop]: Abstraction has 7467 states and 24637 transitions. [2018-11-28 20:05:54,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:05:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 7467 states and 24637 transitions. [2018-11-28 20:05:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 20:05:54,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:05:54,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:05:54,071 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:05:54,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:05:54,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1974914378, now seen corresponding path program 1 times [2018-11-28 20:05:54,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:05:54,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:05:54,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:54,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:05:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:05:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:05:54,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:05:54,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:05:54,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:05:54,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:05:54,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:05:54,348 INFO L87 Difference]: Start difference. First operand 7467 states and 24637 transitions. Second operand 5 states. [2018-11-28 20:05:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:05:56,113 INFO L93 Difference]: Finished difference Result 13999 states and 45806 transitions. [2018-11-28 20:05:56,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:05:56,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-28 20:05:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:05:56,165 INFO L225 Difference]: With dead ends: 13999 [2018-11-28 20:05:56,165 INFO L226 Difference]: Without dead ends: 13931 [2018-11-28 20:05:56,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:05:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13931 states. [2018-11-28 20:05:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13931 to 9442. [2018-11-28 20:05:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9442 states. [2018-11-28 20:05:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9442 states to 9442 states and 30543 transitions. [2018-11-28 20:05:56,683 INFO L78 Accepts]: Start accepts. Automaton has 9442 states and 30543 transitions. Word has length 47 [2018-11-28 20:05:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:05:56,684 INFO L480 AbstractCegarLoop]: Abstraction has 9442 states and 30543 transitions. [2018-11-28 20:05:56,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:05:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 9442 states and 30543 transitions. [2018-11-28 20:05:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 20:05:56,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:05:56,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:05:56,691 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:05:56,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:05:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash 489356304, now seen corresponding path program 1 times [2018-11-28 20:05:56,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:05:56,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:05:56,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:56,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:05:56,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:05:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:05:56,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:05:56,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:05:56,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:05:56,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:05:56,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:05:56,808 INFO L87 Difference]: Start difference. First operand 9442 states and 30543 transitions. Second operand 3 states. [2018-11-28 20:05:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:05:56,953 INFO L93 Difference]: Finished difference Result 13280 states and 42642 transitions. [2018-11-28 20:05:56,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:05:56,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-28 20:05:56,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:05:56,990 INFO L225 Difference]: With dead ends: 13280 [2018-11-28 20:05:56,990 INFO L226 Difference]: Without dead ends: 13280 [2018-11-28 20:05:56,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:05:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13280 states. [2018-11-28 20:05:57,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13280 to 9846. [2018-11-28 20:05:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9846 states. [2018-11-28 20:05:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 31509 transitions. [2018-11-28 20:05:57,268 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 31509 transitions. Word has length 49 [2018-11-28 20:05:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:05:57,269 INFO L480 AbstractCegarLoop]: Abstraction has 9846 states and 31509 transitions. [2018-11-28 20:05:57,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:05:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 31509 transitions. [2018-11-28 20:05:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 20:05:57,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:05:57,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:05:57,272 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:05:57,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:05:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash 35134875, now seen corresponding path program 1 times [2018-11-28 20:05:57,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:05:57,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:05:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:57,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:05:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:05:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:05:57,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:05:57,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:05:57,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:05:57,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:05:57,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:05:57,640 INFO L87 Difference]: Start difference. First operand 9846 states and 31509 transitions. Second operand 6 states. [2018-11-28 20:05:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:05:58,404 INFO L93 Difference]: Finished difference Result 14204 states and 45065 transitions. [2018-11-28 20:05:58,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:05:58,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-11-28 20:05:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:05:58,435 INFO L225 Difference]: With dead ends: 14204 [2018-11-28 20:05:58,435 INFO L226 Difference]: Without dead ends: 14132 [2018-11-28 20:05:58,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:05:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14132 states. [2018-11-28 20:05:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14132 to 10850. [2018-11-28 20:05:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10850 states. [2018-11-28 20:05:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10850 states to 10850 states and 34564 transitions. [2018-11-28 20:05:58,713 INFO L78 Accepts]: Start accepts. Automaton has 10850 states and 34564 transitions. Word has length 53 [2018-11-28 20:05:58,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:05:58,713 INFO L480 AbstractCegarLoop]: Abstraction has 10850 states and 34564 transitions. [2018-11-28 20:05:58,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:05:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 10850 states and 34564 transitions. [2018-11-28 20:05:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 20:05:58,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:05:58,720 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] [2018-11-28 20:05:58,720 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:05:58,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:05:58,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1993804535, now seen corresponding path program 1 times [2018-11-28 20:05:58,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:05:58,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:05:58,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:58,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:05:58,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:05:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:05:58,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:05:58,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:05:58,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:05:58,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:05:58,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:05:58,934 INFO L87 Difference]: Start difference. First operand 10850 states and 34564 transitions. Second operand 4 states. [2018-11-28 20:05:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:05:59,184 INFO L93 Difference]: Finished difference Result 12397 states and 39573 transitions. [2018-11-28 20:05:59,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:05:59,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-11-28 20:05:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:05:59,208 INFO L225 Difference]: With dead ends: 12397 [2018-11-28 20:05:59,209 INFO L226 Difference]: Without dead ends: 12397 [2018-11-28 20:05:59,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:05:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12397 states. [2018-11-28 20:05:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12397 to 11370. [2018-11-28 20:05:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11370 states. [2018-11-28 20:05:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11370 states to 11370 states and 36237 transitions. [2018-11-28 20:05:59,488 INFO L78 Accepts]: Start accepts. Automaton has 11370 states and 36237 transitions. Word has length 61 [2018-11-28 20:05:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:05:59,489 INFO L480 AbstractCegarLoop]: Abstraction has 11370 states and 36237 transitions. [2018-11-28 20:05:59,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:05:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 11370 states and 36237 transitions. [2018-11-28 20:05:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 20:05:59,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:05:59,498 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] [2018-11-28 20:05:59,498 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:05:59,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:05:59,499 INFO L82 PathProgramCache]: Analyzing trace with hash -558352426, now seen corresponding path program 1 times [2018-11-28 20:05:59,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:05:59,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:05:59,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:59,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:05:59,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:05:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:05:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:05:59,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:05:59,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:05:59,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:05:59,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:05:59,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:05:59,783 INFO L87 Difference]: Start difference. First operand 11370 states and 36237 transitions. Second operand 6 states. [2018-11-28 20:06:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:00,615 INFO L93 Difference]: Finished difference Result 20970 states and 66487 transitions. [2018-11-28 20:06:00,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:06:00,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-11-28 20:06:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:00,665 INFO L225 Difference]: With dead ends: 20970 [2018-11-28 20:06:00,665 INFO L226 Difference]: Without dead ends: 20899 [2018-11-28 20:06:00,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:06:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20899 states. [2018-11-28 20:06:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20899 to 13756. [2018-11-28 20:06:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13756 states. [2018-11-28 20:06:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 43281 transitions. [2018-11-28 20:06:01,315 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 43281 transitions. Word has length 61 [2018-11-28 20:06:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:01,315 INFO L480 AbstractCegarLoop]: Abstraction has 13756 states and 43281 transitions. [2018-11-28 20:06:01,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:06:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 43281 transitions. [2018-11-28 20:06:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:06:01,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:01,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:01,326 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:01,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1959879191, now seen corresponding path program 1 times [2018-11-28 20:06:01,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:01,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:01,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:01,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:01,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:01,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:01,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:06:01,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:06:01,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:06:01,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:06:01,471 INFO L87 Difference]: Start difference. First operand 13756 states and 43281 transitions. Second operand 3 states. [2018-11-28 20:06:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:01,794 INFO L93 Difference]: Finished difference Result 14388 states and 44981 transitions. [2018-11-28 20:06:01,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:06:01,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-11-28 20:06:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:01,822 INFO L225 Difference]: With dead ends: 14388 [2018-11-28 20:06:01,822 INFO L226 Difference]: Without dead ends: 14388 [2018-11-28 20:06:01,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:06:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14388 states. [2018-11-28 20:06:02,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14388 to 14072. [2018-11-28 20:06:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14072 states. [2018-11-28 20:06:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 44131 transitions. [2018-11-28 20:06:02,065 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 44131 transitions. Word has length 65 [2018-11-28 20:06:02,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:02,065 INFO L480 AbstractCegarLoop]: Abstraction has 14072 states and 44131 transitions. [2018-11-28 20:06:02,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:06:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 44131 transitions. [2018-11-28 20:06:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:06:02,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:02,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:02,074 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:02,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash 117330152, now seen corresponding path program 1 times [2018-11-28 20:06:02,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:02,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:02,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:02,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:02,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:02,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:06:02,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:06:02,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:06:02,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:06:02,327 INFO L87 Difference]: Start difference. First operand 14072 states and 44131 transitions. Second operand 4 states. [2018-11-28 20:06:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:02,933 INFO L93 Difference]: Finished difference Result 17952 states and 55436 transitions. [2018-11-28 20:06:02,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:06:02,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-28 20:06:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:02,965 INFO L225 Difference]: With dead ends: 17952 [2018-11-28 20:06:02,965 INFO L226 Difference]: Without dead ends: 17952 [2018-11-28 20:06:02,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:06:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2018-11-28 20:06:03,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 16110. [2018-11-28 20:06:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16110 states. [2018-11-28 20:06:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16110 states to 16110 states and 49982 transitions. [2018-11-28 20:06:03,253 INFO L78 Accepts]: Start accepts. Automaton has 16110 states and 49982 transitions. Word has length 65 [2018-11-28 20:06:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:03,253 INFO L480 AbstractCegarLoop]: Abstraction has 16110 states and 49982 transitions. [2018-11-28 20:06:03,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:06:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 16110 states and 49982 transitions. [2018-11-28 20:06:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:06:03,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:03,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:03,271 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:03,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1735068466, now seen corresponding path program 1 times [2018-11-28 20:06:03,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:03,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:03,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:03,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:03,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:03,439 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 20:06:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:03,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:03,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:06:03,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:06:03,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:06:03,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:06:03,488 INFO L87 Difference]: Start difference. First operand 16110 states and 49982 transitions. Second operand 6 states. [2018-11-28 20:06:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:04,895 INFO L93 Difference]: Finished difference Result 19822 states and 60438 transitions. [2018-11-28 20:06:04,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:06:04,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-28 20:06:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:04,932 INFO L225 Difference]: With dead ends: 19822 [2018-11-28 20:06:04,932 INFO L226 Difference]: Without dead ends: 19822 [2018-11-28 20:06:04,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:06:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19822 states. [2018-11-28 20:06:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19822 to 18618. [2018-11-28 20:06:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18618 states. [2018-11-28 20:06:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 57218 transitions. [2018-11-28 20:06:05,460 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 57218 transitions. Word has length 67 [2018-11-28 20:06:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:05,460 INFO L480 AbstractCegarLoop]: Abstraction has 18618 states and 57218 transitions. [2018-11-28 20:06:05,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:06:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 57218 transitions. [2018-11-28 20:06:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:06:05,473 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:05,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:05,474 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:05,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:05,474 INFO L82 PathProgramCache]: Analyzing trace with hash -342140877, now seen corresponding path program 1 times [2018-11-28 20:06:05,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:05,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:05,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:05,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:05,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:05,903 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:06:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:06,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:06,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:06:06,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:06:06,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:06:06,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:06:06,017 INFO L87 Difference]: Start difference. First operand 18618 states and 57218 transitions. Second operand 6 states. [2018-11-28 20:06:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:06,875 INFO L93 Difference]: Finished difference Result 21450 states and 63627 transitions. [2018-11-28 20:06:06,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:06:06,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-28 20:06:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:06,914 INFO L225 Difference]: With dead ends: 21450 [2018-11-28 20:06:06,914 INFO L226 Difference]: Without dead ends: 21450 [2018-11-28 20:06:06,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:06:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21450 states. [2018-11-28 20:06:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21450 to 19134. [2018-11-28 20:06:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19134 states. [2018-11-28 20:06:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19134 states to 19134 states and 57765 transitions. [2018-11-28 20:06:07,224 INFO L78 Accepts]: Start accepts. Automaton has 19134 states and 57765 transitions. Word has length 67 [2018-11-28 20:06:07,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:07,224 INFO L480 AbstractCegarLoop]: Abstraction has 19134 states and 57765 transitions. [2018-11-28 20:06:07,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:06:07,224 INFO L276 IsEmpty]: Start isEmpty. Operand 19134 states and 57765 transitions. [2018-11-28 20:06:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:06:07,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:07,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:07,239 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:07,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:07,239 INFO L82 PathProgramCache]: Analyzing trace with hash -130789964, now seen corresponding path program 1 times [2018-11-28 20:06:07,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:07,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:07,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:07,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:07,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:07,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-11-28 20:06:07,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:07,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:06:07,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:06:07,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:06:07,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:06:07,353 INFO L87 Difference]: Start difference. First operand 19134 states and 57765 transitions. Second operand 5 states. [2018-11-28 20:06:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:08,185 INFO L93 Difference]: Finished difference Result 25025 states and 75019 transitions. [2018-11-28 20:06:08,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:06:08,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 20:06:08,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:08,231 INFO L225 Difference]: With dead ends: 25025 [2018-11-28 20:06:08,231 INFO L226 Difference]: Without dead ends: 25025 [2018-11-28 20:06:08,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:06:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25025 states. [2018-11-28 20:06:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25025 to 22710. [2018-11-28 20:06:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22710 states. [2018-11-28 20:06:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22710 states to 22710 states and 68033 transitions. [2018-11-28 20:06:08,626 INFO L78 Accepts]: Start accepts. Automaton has 22710 states and 68033 transitions. Word has length 67 [2018-11-28 20:06:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:08,626 INFO L480 AbstractCegarLoop]: Abstraction has 22710 states and 68033 transitions. [2018-11-28 20:06:08,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:06:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 22710 states and 68033 transitions. [2018-11-28 20:06:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:06:08,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:08,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:08,643 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:08,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash -641324141, now seen corresponding path program 1 times [2018-11-28 20:06:08,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:08,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:08,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:08,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:08,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:09,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:09,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:06:09,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:06:09,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:06:09,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:06:09,076 INFO L87 Difference]: Start difference. First operand 22710 states and 68033 transitions. Second operand 5 states. [2018-11-28 20:06:09,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:09,786 INFO L93 Difference]: Finished difference Result 31960 states and 94872 transitions. [2018-11-28 20:06:09,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:06:09,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 20:06:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:09,842 INFO L225 Difference]: With dead ends: 31960 [2018-11-28 20:06:09,842 INFO L226 Difference]: Without dead ends: 31960 [2018-11-28 20:06:09,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:06:09,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31960 states. [2018-11-28 20:06:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31960 to 28240. [2018-11-28 20:06:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28240 states. [2018-11-28 20:06:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28240 states to 28240 states and 84260 transitions. [2018-11-28 20:06:10,412 INFO L78 Accepts]: Start accepts. Automaton has 28240 states and 84260 transitions. Word has length 67 [2018-11-28 20:06:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:10,413 INFO L480 AbstractCegarLoop]: Abstraction has 28240 states and 84260 transitions. [2018-11-28 20:06:10,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:06:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 28240 states and 84260 transitions. [2018-11-28 20:06:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:06:10,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:10,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:10,432 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:10,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:10,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1846188692, now seen corresponding path program 1 times [2018-11-28 20:06:10,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:10,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:10,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:10,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:10,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:10,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:10,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:06:10,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:06:10,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:06:10,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:06:10,679 INFO L87 Difference]: Start difference. First operand 28240 states and 84260 transitions. Second operand 5 states. [2018-11-28 20:06:10,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:10,776 INFO L93 Difference]: Finished difference Result 9044 states and 21835 transitions. [2018-11-28 20:06:10,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:06:10,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 20:06:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:10,788 INFO L225 Difference]: With dead ends: 9044 [2018-11-28 20:06:10,788 INFO L226 Difference]: Without dead ends: 7192 [2018-11-28 20:06:10,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:06:10,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2018-11-28 20:06:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 6089. [2018-11-28 20:06:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6089 states. [2018-11-28 20:06:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6089 states to 6089 states and 14306 transitions. [2018-11-28 20:06:11,128 INFO L78 Accepts]: Start accepts. Automaton has 6089 states and 14306 transitions. Word has length 67 [2018-11-28 20:06:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:11,129 INFO L480 AbstractCegarLoop]: Abstraction has 6089 states and 14306 transitions. [2018-11-28 20:06:11,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:06:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 6089 states and 14306 transitions. [2018-11-28 20:06:11,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:06:11,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:11,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:11,136 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:11,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:11,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1392892313, now seen corresponding path program 1 times [2018-11-28 20:06:11,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:11,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:11,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:11,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:11,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:11,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:11,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:06:11,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:06:11,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:06:11,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:06:11,229 INFO L87 Difference]: Start difference. First operand 6089 states and 14306 transitions. Second operand 3 states. [2018-11-28 20:06:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:11,478 INFO L93 Difference]: Finished difference Result 8276 states and 19333 transitions. [2018-11-28 20:06:11,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:06:11,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-11-28 20:06:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:11,492 INFO L225 Difference]: With dead ends: 8276 [2018-11-28 20:06:11,493 INFO L226 Difference]: Without dead ends: 8276 [2018-11-28 20:06:11,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:06:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8276 states. [2018-11-28 20:06:11,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8276 to 6028. [2018-11-28 20:06:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6028 states. [2018-11-28 20:06:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6028 states to 6028 states and 13846 transitions. [2018-11-28 20:06:11,608 INFO L78 Accepts]: Start accepts. Automaton has 6028 states and 13846 transitions. Word has length 67 [2018-11-28 20:06:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:11,608 INFO L480 AbstractCegarLoop]: Abstraction has 6028 states and 13846 transitions. [2018-11-28 20:06:11,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:06:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 6028 states and 13846 transitions. [2018-11-28 20:06:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 20:06:11,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:11,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:11,623 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:11,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:11,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1912290010, now seen corresponding path program 1 times [2018-11-28 20:06:11,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:11,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:11,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:11,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:11,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:11,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:11,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:06:11,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:06:11,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:06:11,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:06:11,803 INFO L87 Difference]: Start difference. First operand 6028 states and 13846 transitions. Second operand 5 states. [2018-11-28 20:06:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:12,079 INFO L93 Difference]: Finished difference Result 7198 states and 16487 transitions. [2018-11-28 20:06:12,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:06:12,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-28 20:06:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:12,092 INFO L225 Difference]: With dead ends: 7198 [2018-11-28 20:06:12,092 INFO L226 Difference]: Without dead ends: 7198 [2018-11-28 20:06:12,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:06:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7198 states. [2018-11-28 20:06:12,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7198 to 6472. [2018-11-28 20:06:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6472 states. [2018-11-28 20:06:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6472 states to 6472 states and 14850 transitions. [2018-11-28 20:06:12,184 INFO L78 Accepts]: Start accepts. Automaton has 6472 states and 14850 transitions. Word has length 73 [2018-11-28 20:06:12,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:12,184 INFO L480 AbstractCegarLoop]: Abstraction has 6472 states and 14850 transitions. [2018-11-28 20:06:12,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:06:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6472 states and 14850 transitions. [2018-11-28 20:06:12,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 20:06:12,193 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:12,193 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] [2018-11-28 20:06:12,194 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:12,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:12,194 INFO L82 PathProgramCache]: Analyzing trace with hash -639866951, now seen corresponding path program 1 times [2018-11-28 20:06:12,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:12,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:12,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:12,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:12,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:12,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:12,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:06:12,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:06:12,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:06:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:06:12,320 INFO L87 Difference]: Start difference. First operand 6472 states and 14850 transitions. Second operand 7 states. [2018-11-28 20:06:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:12,824 INFO L93 Difference]: Finished difference Result 7545 states and 17112 transitions. [2018-11-28 20:06:12,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:06:12,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-11-28 20:06:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:12,843 INFO L225 Difference]: With dead ends: 7545 [2018-11-28 20:06:12,843 INFO L226 Difference]: Without dead ends: 7426 [2018-11-28 20:06:12,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-28 20:06:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2018-11-28 20:06:12,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 6569. [2018-11-28 20:06:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6569 states. [2018-11-28 20:06:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6569 states to 6569 states and 14943 transitions. [2018-11-28 20:06:12,934 INFO L78 Accepts]: Start accepts. Automaton has 6569 states and 14943 transitions. Word has length 73 [2018-11-28 20:06:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:12,934 INFO L480 AbstractCegarLoop]: Abstraction has 6569 states and 14943 transitions. [2018-11-28 20:06:12,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:06:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 6569 states and 14943 transitions. [2018-11-28 20:06:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:06:12,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:12,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:12,946 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:12,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:12,946 INFO L82 PathProgramCache]: Analyzing trace with hash 200709404, now seen corresponding path program 1 times [2018-11-28 20:06:12,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:12,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:12,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:12,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:12,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:13,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:13,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:06:13,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:06:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:06:13,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:06:13,127 INFO L87 Difference]: Start difference. First operand 6569 states and 14943 transitions. Second operand 4 states. [2018-11-28 20:06:13,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:13,505 INFO L93 Difference]: Finished difference Result 10256 states and 23214 transitions. [2018-11-28 20:06:13,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:06:13,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-28 20:06:13,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:13,520 INFO L225 Difference]: With dead ends: 10256 [2018-11-28 20:06:13,520 INFO L226 Difference]: Without dead ends: 10256 [2018-11-28 20:06:13,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:06:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10256 states. [2018-11-28 20:06:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10256 to 7689. [2018-11-28 20:06:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7689 states. [2018-11-28 20:06:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 17277 transitions. [2018-11-28 20:06:13,629 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 17277 transitions. Word has length 92 [2018-11-28 20:06:13,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:13,630 INFO L480 AbstractCegarLoop]: Abstraction has 7689 states and 17277 transitions. [2018-11-28 20:06:13,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:06:13,630 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 17277 transitions. [2018-11-28 20:06:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:06:13,639 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:13,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:13,640 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:13,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:13,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1902232767, now seen corresponding path program 1 times [2018-11-28 20:06:13,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:13,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:13,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:13,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:13,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:13,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:13,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:06:13,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:06:13,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:06:13,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:06:13,731 INFO L87 Difference]: Start difference. First operand 7689 states and 17277 transitions. Second operand 4 states. [2018-11-28 20:06:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:13,867 INFO L93 Difference]: Finished difference Result 8254 states and 18570 transitions. [2018-11-28 20:06:13,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:06:13,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-28 20:06:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:13,878 INFO L225 Difference]: With dead ends: 8254 [2018-11-28 20:06:13,878 INFO L226 Difference]: Without dead ends: 8254 [2018-11-28 20:06:13,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:06:13,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8254 states. [2018-11-28 20:06:13,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8254 to 7595. [2018-11-28 20:06:13,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7595 states. [2018-11-28 20:06:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7595 states to 7595 states and 17172 transitions. [2018-11-28 20:06:13,968 INFO L78 Accepts]: Start accepts. Automaton has 7595 states and 17172 transitions. Word has length 92 [2018-11-28 20:06:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:13,968 INFO L480 AbstractCegarLoop]: Abstraction has 7595 states and 17172 transitions. [2018-11-28 20:06:13,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:06:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 7595 states and 17172 transitions. [2018-11-28 20:06:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:06:13,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:13,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:13,978 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:13,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:13,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1887766174, now seen corresponding path program 1 times [2018-11-28 20:06:13,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:13,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:13,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:13,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:13,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:14,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:14,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:06:14,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:06:14,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:06:14,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:06:14,166 INFO L87 Difference]: Start difference. First operand 7595 states and 17172 transitions. Second operand 5 states. [2018-11-28 20:06:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:14,613 INFO L93 Difference]: Finished difference Result 7161 states and 16024 transitions. [2018-11-28 20:06:14,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:06:14,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-28 20:06:14,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:14,624 INFO L225 Difference]: With dead ends: 7161 [2018-11-28 20:06:14,625 INFO L226 Difference]: Without dead ends: 7161 [2018-11-28 20:06:14,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:06:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2018-11-28 20:06:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 6729. [2018-11-28 20:06:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6729 states. [2018-11-28 20:06:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 15087 transitions. [2018-11-28 20:06:14,709 INFO L78 Accepts]: Start accepts. Automaton has 6729 states and 15087 transitions. Word has length 94 [2018-11-28 20:06:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:14,710 INFO L480 AbstractCegarLoop]: Abstraction has 6729 states and 15087 transitions. [2018-11-28 20:06:14,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:06:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 6729 states and 15087 transitions. [2018-11-28 20:06:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:06:14,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:14,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:14,719 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:14,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash -935753532, now seen corresponding path program 2 times [2018-11-28 20:06:14,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:14,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:14,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:14,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:14,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:15,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:15,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:06:15,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:06:15,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:06:15,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:06:15,076 INFO L87 Difference]: Start difference. First operand 6729 states and 15087 transitions. Second operand 5 states. [2018-11-28 20:06:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:15,624 INFO L93 Difference]: Finished difference Result 7978 states and 17830 transitions. [2018-11-28 20:06:15,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:06:15,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-28 20:06:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:15,635 INFO L225 Difference]: With dead ends: 7978 [2018-11-28 20:06:15,636 INFO L226 Difference]: Without dead ends: 7978 [2018-11-28 20:06:15,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:06:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7978 states. [2018-11-28 20:06:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7978 to 6211. [2018-11-28 20:06:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2018-11-28 20:06:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 13938 transitions. [2018-11-28 20:06:15,718 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 13938 transitions. Word has length 94 [2018-11-28 20:06:15,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:15,719 INFO L480 AbstractCegarLoop]: Abstraction has 6211 states and 13938 transitions. [2018-11-28 20:06:15,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:06:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 13938 transitions. [2018-11-28 20:06:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:06:15,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:15,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:15,729 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:15,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1014546723, now seen corresponding path program 1 times [2018-11-28 20:06:15,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:15,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:15,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:15,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:06:15,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:16,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:16,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:06:16,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:06:16,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:06:16,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:06:16,132 INFO L87 Difference]: Start difference. First operand 6211 states and 13938 transitions. Second operand 7 states. [2018-11-28 20:06:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:16,512 INFO L93 Difference]: Finished difference Result 8190 states and 18131 transitions. [2018-11-28 20:06:16,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 20:06:16,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-11-28 20:06:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:16,523 INFO L225 Difference]: With dead ends: 8190 [2018-11-28 20:06:16,523 INFO L226 Difference]: Without dead ends: 8077 [2018-11-28 20:06:16,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:06:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8077 states. [2018-11-28 20:06:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8077 to 6752. [2018-11-28 20:06:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6752 states. [2018-11-28 20:06:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6752 states to 6752 states and 15057 transitions. [2018-11-28 20:06:16,603 INFO L78 Accepts]: Start accepts. Automaton has 6752 states and 15057 transitions. Word has length 94 [2018-11-28 20:06:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:16,603 INFO L480 AbstractCegarLoop]: Abstraction has 6752 states and 15057 transitions. [2018-11-28 20:06:16,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:06:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6752 states and 15057 transitions. [2018-11-28 20:06:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:06:16,611 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:16,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:16,612 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:16,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:16,612 INFO L82 PathProgramCache]: Analyzing trace with hash -314852828, now seen corresponding path program 1 times [2018-11-28 20:06:16,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:16,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:16,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:16,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:16,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:16,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:16,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:06:16,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:06:16,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:06:16,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:06:16,836 INFO L87 Difference]: Start difference. First operand 6752 states and 15057 transitions. Second operand 6 states. [2018-11-28 20:06:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:17,333 INFO L93 Difference]: Finished difference Result 7665 states and 17190 transitions. [2018-11-28 20:06:17,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:06:17,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 20:06:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:17,344 INFO L225 Difference]: With dead ends: 7665 [2018-11-28 20:06:17,344 INFO L226 Difference]: Without dead ends: 7665 [2018-11-28 20:06:17,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:06:17,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7665 states. [2018-11-28 20:06:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7665 to 6956. [2018-11-28 20:06:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6956 states. [2018-11-28 20:06:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6956 states to 6956 states and 15504 transitions. [2018-11-28 20:06:17,430 INFO L78 Accepts]: Start accepts. Automaton has 6956 states and 15504 transitions. Word has length 94 [2018-11-28 20:06:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:17,431 INFO L480 AbstractCegarLoop]: Abstraction has 6956 states and 15504 transitions. [2018-11-28 20:06:17,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:06:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 6956 states and 15504 transitions. [2018-11-28 20:06:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:06:17,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:17,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:17,441 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:17,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:17,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1128782067, now seen corresponding path program 1 times [2018-11-28 20:06:17,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:17,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:17,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:17,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:17,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:17,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:06:17,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:06:17,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:06:17,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:06:17,611 INFO L87 Difference]: Start difference. First operand 6956 states and 15504 transitions. Second operand 7 states. [2018-11-28 20:06:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:18,087 INFO L93 Difference]: Finished difference Result 9851 states and 21976 transitions. [2018-11-28 20:06:18,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:06:18,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-11-28 20:06:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:18,101 INFO L225 Difference]: With dead ends: 9851 [2018-11-28 20:06:18,101 INFO L226 Difference]: Without dead ends: 9819 [2018-11-28 20:06:18,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:06:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9819 states. [2018-11-28 20:06:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9819 to 8981. [2018-11-28 20:06:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8981 states. [2018-11-28 20:06:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8981 states to 8981 states and 20007 transitions. [2018-11-28 20:06:18,298 INFO L78 Accepts]: Start accepts. Automaton has 8981 states and 20007 transitions. Word has length 94 [2018-11-28 20:06:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:18,299 INFO L480 AbstractCegarLoop]: Abstraction has 8981 states and 20007 transitions. [2018-11-28 20:06:18,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:06:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 8981 states and 20007 transitions. [2018-11-28 20:06:18,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:06:18,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:18,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:18,309 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:18,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1369233870, now seen corresponding path program 1 times [2018-11-28 20:06:18,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:18,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:18,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:18,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:18,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:18,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:18,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:06:18,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:06:18,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:06:18,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:06:18,536 INFO L87 Difference]: Start difference. First operand 8981 states and 20007 transitions. Second operand 8 states. [2018-11-28 20:06:20,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:20,360 INFO L93 Difference]: Finished difference Result 14437 states and 33144 transitions. [2018-11-28 20:06:20,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:06:20,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-11-28 20:06:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:20,379 INFO L225 Difference]: With dead ends: 14437 [2018-11-28 20:06:20,379 INFO L226 Difference]: Without dead ends: 14437 [2018-11-28 20:06:20,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:06:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14437 states. [2018-11-28 20:06:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14437 to 9732. [2018-11-28 20:06:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9732 states. [2018-11-28 20:06:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 21955 transitions. [2018-11-28 20:06:20,527 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 21955 transitions. Word has length 94 [2018-11-28 20:06:20,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:20,527 INFO L480 AbstractCegarLoop]: Abstraction has 9732 states and 21955 transitions. [2018-11-28 20:06:20,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:06:20,527 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 21955 transitions. [2018-11-28 20:06:20,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:06:20,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:20,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:20,538 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:20,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:20,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2038229745, now seen corresponding path program 1 times [2018-11-28 20:06:20,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:20,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:20,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:20,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:20,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:20,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:20,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:06:20,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:06:20,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:06:20,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:06:20,652 INFO L87 Difference]: Start difference. First operand 9732 states and 21955 transitions. Second operand 6 states. [2018-11-28 20:06:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:20,898 INFO L93 Difference]: Finished difference Result 9395 states and 21217 transitions. [2018-11-28 20:06:20,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:06:20,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 20:06:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:20,911 INFO L225 Difference]: With dead ends: 9395 [2018-11-28 20:06:20,911 INFO L226 Difference]: Without dead ends: 9395 [2018-11-28 20:06:20,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:06:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9395 states. [2018-11-28 20:06:21,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9395 to 9162. [2018-11-28 20:06:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9162 states. [2018-11-28 20:06:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9162 states to 9162 states and 20739 transitions. [2018-11-28 20:06:21,020 INFO L78 Accepts]: Start accepts. Automaton has 9162 states and 20739 transitions. Word has length 94 [2018-11-28 20:06:21,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:21,020 INFO L480 AbstractCegarLoop]: Abstraction has 9162 states and 20739 transitions. [2018-11-28 20:06:21,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:06:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 9162 states and 20739 transitions. [2018-11-28 20:06:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:06:21,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:21,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:21,032 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:21,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:21,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1117465940, now seen corresponding path program 1 times [2018-11-28 20:06:21,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:21,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:21,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:21,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:21,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:21,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:21,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:06:21,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:06:21,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:06:21,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:06:21,334 INFO L87 Difference]: Start difference. First operand 9162 states and 20739 transitions. Second operand 9 states. [2018-11-28 20:06:22,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:22,121 INFO L93 Difference]: Finished difference Result 11595 states and 26309 transitions. [2018-11-28 20:06:22,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 20:06:22,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-11-28 20:06:22,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:22,136 INFO L225 Difference]: With dead ends: 11595 [2018-11-28 20:06:22,136 INFO L226 Difference]: Without dead ends: 11563 [2018-11-28 20:06:22,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-11-28 20:06:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11563 states. [2018-11-28 20:06:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11563 to 8614. [2018-11-28 20:06:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8614 states. [2018-11-28 20:06:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8614 states to 8614 states and 19441 transitions. [2018-11-28 20:06:22,247 INFO L78 Accepts]: Start accepts. Automaton has 8614 states and 19441 transitions. Word has length 94 [2018-11-28 20:06:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:22,248 INFO L480 AbstractCegarLoop]: Abstraction has 8614 states and 19441 transitions. [2018-11-28 20:06:22,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:06:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 8614 states and 19441 transitions. [2018-11-28 20:06:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:06:22,257 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:22,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:06:22,257 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:22,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:22,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2026913618, now seen corresponding path program 1 times [2018-11-28 20:06:22,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:22,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:22,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:22,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:22,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:22,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:22,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:06:22,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:06:22,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:06:22,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:06:22,606 INFO L87 Difference]: Start difference. First operand 8614 states and 19441 transitions. Second operand 7 states. [2018-11-28 20:06:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:22,778 INFO L93 Difference]: Finished difference Result 11903 states and 27394 transitions. [2018-11-28 20:06:22,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:06:22,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-11-28 20:06:22,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:22,794 INFO L225 Difference]: With dead ends: 11903 [2018-11-28 20:06:22,794 INFO L226 Difference]: Without dead ends: 11903 [2018-11-28 20:06:22,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:06:22,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11903 states. [2018-11-28 20:06:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11903 to 8257. [2018-11-28 20:06:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8257 states. [2018-11-28 20:06:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8257 states to 8257 states and 18540 transitions. [2018-11-28 20:06:22,900 INFO L78 Accepts]: Start accepts. Automaton has 8257 states and 18540 transitions. Word has length 94 [2018-11-28 20:06:22,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:22,900 INFO L480 AbstractCegarLoop]: Abstraction has 8257 states and 18540 transitions. [2018-11-28 20:06:22,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:06:22,900 INFO L276 IsEmpty]: Start isEmpty. Operand 8257 states and 18540 transitions. [2018-11-28 20:06:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:06:22,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:22,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] [2018-11-28 20:06:22,909 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:22,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:22,910 INFO L82 PathProgramCache]: Analyzing trace with hash 536078126, now seen corresponding path program 1 times [2018-11-28 20:06:22,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:22,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:22,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:22,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:23,337 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:06:23,747 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-11-28 20:06:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:23,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:23,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:06:23,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:06:23,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:06:23,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:06:23,762 INFO L87 Difference]: Start difference. First operand 8257 states and 18540 transitions. Second operand 6 states. [2018-11-28 20:06:24,075 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 20:06:24,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:24,371 INFO L93 Difference]: Finished difference Result 7985 states and 17588 transitions. [2018-11-28 20:06:24,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:06:24,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 20:06:24,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:24,381 INFO L225 Difference]: With dead ends: 7985 [2018-11-28 20:06:24,381 INFO L226 Difference]: Without dead ends: 7985 [2018-11-28 20:06:24,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:06:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7985 states. [2018-11-28 20:06:24,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7985 to 5081. [2018-11-28 20:06:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5081 states. [2018-11-28 20:06:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 11078 transitions. [2018-11-28 20:06:24,452 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 11078 transitions. Word has length 94 [2018-11-28 20:06:24,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:24,453 INFO L480 AbstractCegarLoop]: Abstraction has 5081 states and 11078 transitions. [2018-11-28 20:06:24,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:06:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 11078 transitions. [2018-11-28 20:06:24,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:06:24,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:24,458 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] [2018-11-28 20:06:24,459 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:24,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:24,459 INFO L82 PathProgramCache]: Analyzing trace with hash -760273554, now seen corresponding path program 1 times [2018-11-28 20:06:24,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:24,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:24,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:24,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:24,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:24,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:24,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:06:24,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:06:24,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:06:24,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:06:24,833 INFO L87 Difference]: Start difference. First operand 5081 states and 11078 transitions. Second operand 7 states. [2018-11-28 20:06:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:25,084 INFO L93 Difference]: Finished difference Result 5571 states and 12165 transitions. [2018-11-28 20:06:25,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:06:25,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-28 20:06:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:25,093 INFO L225 Difference]: With dead ends: 5571 [2018-11-28 20:06:25,093 INFO L226 Difference]: Without dead ends: 5571 [2018-11-28 20:06:25,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:06:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5571 states. [2018-11-28 20:06:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5571 to 5409. [2018-11-28 20:06:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5409 states. [2018-11-28 20:06:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5409 states to 5409 states and 11840 transitions. [2018-11-28 20:06:25,157 INFO L78 Accepts]: Start accepts. Automaton has 5409 states and 11840 transitions. Word has length 96 [2018-11-28 20:06:25,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:25,157 INFO L480 AbstractCegarLoop]: Abstraction has 5409 states and 11840 transitions. [2018-11-28 20:06:25,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:06:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5409 states and 11840 transitions. [2018-11-28 20:06:25,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:06:25,164 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:25,164 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] [2018-11-28 20:06:25,164 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:25,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:25,165 INFO L82 PathProgramCache]: Analyzing trace with hash 127230127, now seen corresponding path program 1 times [2018-11-28 20:06:25,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:25,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:25,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:25,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:25,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:06:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:06:25,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:06:25,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:06:25,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:06:25,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:06:25,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:06:25,403 INFO L87 Difference]: Start difference. First operand 5409 states and 11840 transitions. Second operand 11 states. [2018-11-28 20:06:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:06:27,039 INFO L93 Difference]: Finished difference Result 10013 states and 22204 transitions. [2018-11-28 20:06:27,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:06:27,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-11-28 20:06:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:06:27,048 INFO L225 Difference]: With dead ends: 10013 [2018-11-28 20:06:27,049 INFO L226 Difference]: Without dead ends: 6313 [2018-11-28 20:06:27,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-11-28 20:06:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6313 states. [2018-11-28 20:06:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6313 to 4817. [2018-11-28 20:06:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4817 states. [2018-11-28 20:06:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4817 states to 4817 states and 10517 transitions. [2018-11-28 20:06:27,107 INFO L78 Accepts]: Start accepts. Automaton has 4817 states and 10517 transitions. Word has length 96 [2018-11-28 20:06:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:06:27,107 INFO L480 AbstractCegarLoop]: Abstraction has 4817 states and 10517 transitions. [2018-11-28 20:06:27,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:06:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4817 states and 10517 transitions. [2018-11-28 20:06:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:06:27,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:06:27,113 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] [2018-11-28 20:06:27,113 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:06:27,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:06:27,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1130643175, now seen corresponding path program 2 times [2018-11-28 20:06:27,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:06:27,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:06:27,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:27,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:06:27,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:06:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:06:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:06:27,204 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:06:27,402 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:06:27,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:06:27 BasicIcfg [2018-11-28 20:06:27,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:06:27,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:06:27,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:06:27,406 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:06:27,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:05:46" (3/4) ... [2018-11-28 20:06:27,412 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:06:27,622 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:06:27,626 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:06:27,627 INFO L168 Benchmark]: Toolchain (without parser) took 43233.03 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-28 20:06:27,632 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:06:27,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:06:27,633 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:06:27,636 INFO L168 Benchmark]: Boogie Preprocessor took 44.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:06:27,636 INFO L168 Benchmark]: RCFGBuilder took 1198.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2018-11-28 20:06:27,650 INFO L168 Benchmark]: TraceAbstraction took 40903.88 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -118.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-28 20:06:27,651 INFO L168 Benchmark]: Witness Printer took 220.36 ms. Allocated memory is still 2.8 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2018-11-28 20:06:27,655 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.16 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 783.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.86 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 1198.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40903.88 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -118.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 220.36 ms. Allocated memory is still 2.8 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 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] [L683] -1 int z = 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, z=0] [L684] -1 _Bool z$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, z=0, z$flush_delayed=0] [L685] -1 int z$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, z=0, z$flush_delayed=0, z$mem_tmp=0] [L686] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L687] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L688] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L689] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L690] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L691] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L692] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L693] -1 int *z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L694] -1 int z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L695] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L696] -1 int z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L697] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L698] -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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L699] -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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] -1 pthread_t t1091; 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] FCALL, FORK -1 pthread_create(&t1091, ((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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] 0 z$w_buff1 = z$w_buff0 [L704] 0 z$w_buff0 = 1 [L705] 0 z$w_buff1_used = z$w_buff0_used [L706] 0 z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L708] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L709] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L710] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L711] 0 z$r_buff0_thd1 = (_Bool)1 [L714] 0 x = 1 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] -1 pthread_t t1092; 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] FCALL, FORK -1 pthread_create(&t1092, ((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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 x = 2 [L734] 1 y = 1 [L737] 1 __unbuffered_p1_EAX = y [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 z$flush_delayed = weak$$choice2 [L743] 1 z$mem_tmp = z 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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L745] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$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=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L746] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$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=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L747] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$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=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=0, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$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=0, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = z 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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] EXPR 1 z$flush_delayed ? z$mem_tmp : z 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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L752] 1 z = z$flush_delayed ? z$mem_tmp : z [L753] 1 z$flush_delayed = (_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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z 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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L718] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L718] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L719] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L719] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L721] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 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=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L788] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L789] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L791] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 40.7s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 20.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8103 SDtfs, 8836 SDslu, 19142 SDs, 0 SdLazy, 7488 SolverSat, 394 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 74 SyntacticMatches, 32 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34807occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 77346 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 2441 NumberOfCodeBlocks, 2441 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2314 ConstructedInterpolants, 0 QuantifiedInterpolants, 515411 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...